./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-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-?-e2fb8be-m [2025-03-08 13:40:21,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:40:21,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:40:21,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:40:21,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:40:21,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:40:21,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:40:21,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:40:21,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:40:21,082 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:40:21,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:40:21,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:40:21,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:40:21,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:40:21,083 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:40:21,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:40:21,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:40:21,084 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:40:21,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:40:21,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:40:21,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:40:21,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:40:21,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:40:21,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:40:21,084 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:40:21,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:40:21,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:40:21,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:40:21,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:40:21,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:40:21,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:40:21,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:40:21,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:40:21,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:40:21,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:40:21,086 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:40:21,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:40:21,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:40:21,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:40:21,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:40:21,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:40:21,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:40:21,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:40:21,086 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-08 13:40:21,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:40:21,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:40:21,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:40:21,324 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:40:21,324 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:40:21,325 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-08 13:40:22,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c2bbda6/16df67102ae64588ac39cd4f79e39a82/FLAG95cc90e16 [2025-03-08 13:40:22,765 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:40:22,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.i [2025-03-08 13:40:22,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c2bbda6/16df67102ae64588ac39cd4f79e39a82/FLAG95cc90e16 [2025-03-08 13:40:22,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c2bbda6/16df67102ae64588ac39cd4f79e39a82 [2025-03-08 13:40:22,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:40:22,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:40:22,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:40:22,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:40:22,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:40:22,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:22" (1/1) ... [2025-03-08 13:40:22,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec265d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:22, skipping insertion in model container [2025-03-08 13:40:22,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:22" (1/1) ... [2025-03-08 13:40:22,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:40:22,923 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-08 13:40:22,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:40:22,967 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:40:22,976 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-08 13:40:22,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:40:23,019 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:40:23,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:23 WrapperNode [2025-03-08 13:40:23,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:40:23,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:40:23,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:40:23,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:40:23,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:23" (1/1) ... [2025-03-08 13:40:23,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:23" (1/1) ... [2025-03-08 13:40:23,060 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-08 13:40:23,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:40:23,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:40:23,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:40:23,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:40:23,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:23" (1/1) ... [2025-03-08 13:40:23,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:23" (1/1) ... [2025-03-08 13:40:23,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:23" (1/1) ... [2025-03-08 13:40:23,089 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:40:23,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:23" (1/1) ... [2025-03-08 13:40:23,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:23" (1/1) ... [2025-03-08 13:40:23,093 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:23" (1/1) ... [2025-03-08 13:40:23,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:23" (1/1) ... [2025-03-08 13:40:23,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:23" (1/1) ... [2025-03-08 13:40:23,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:23" (1/1) ... [2025-03-08 13:40:23,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:40:23,102 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:40:23,102 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:40:23,102 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:40:23,103 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:23" (1/1) ... [2025-03-08 13:40:23,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:40:23,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:40:23,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:40:23,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:40:23,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:40:23,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:40:23,151 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:40:23,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:40:23,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:40:23,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:40:23,206 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:40:23,207 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:40:23,409 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 13:40:23,409 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:40:23,416 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:40:23,416 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:40:23,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:23 BoogieIcfgContainer [2025-03-08 13:40:23,417 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:40:23,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:40:23,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:40:23,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:40:23,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:40:22" (1/3) ... [2025-03-08 13:40:23,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f783ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:23, skipping insertion in model container [2025-03-08 13:40:23,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:23" (2/3) ... [2025-03-08 13:40:23,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f783ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:23, skipping insertion in model container [2025-03-08 13:40:23,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:23" (3/3) ... [2025-03-08 13:40:23,425 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-73.i [2025-03-08 13:40:23,436 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:40:23,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-73.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:40:23,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:40:23,487 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;@401f972a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:40:23,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:40:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 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-08 13:40:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 13:40:23,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:23,500 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, 1, 1, 1, 1] [2025-03-08 13:40:23,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:23,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2038930029, now seen corresponding path program 1 times [2025-03-08 13:40:23,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:40:23,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17389284] [2025-03-08 13:40:23,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:23,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:40:23,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 13:40:23,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 13:40:23,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:23,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:23,725 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-08 13:40:23,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:40:23,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17389284] [2025-03-08 13:40:23,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17389284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:40:23,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723009776] [2025-03-08 13:40:23,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:23,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:40:23,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:40:23,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:40:23,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:40:23,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 13:40:23,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 13:40:23,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:23,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:23,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:40:23,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:40:23,870 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-08 13:40:23,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:40:23,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723009776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:40:23,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:40:23,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:40:23,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634391095] [2025-03-08 13:40:23,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:40:23,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:40:23,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:40:23,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:40:23,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:40:23,892 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-08 13:40:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:40:23,906 INFO L93 Difference]: Finished difference Result 98 states and 160 transitions. [2025-03-08 13:40:23,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:40:23,907 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 99 [2025-03-08 13:40:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:40:23,913 INFO L225 Difference]: With dead ends: 98 [2025-03-08 13:40:23,913 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 13:40:23,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:40:23,917 INFO L435 NwaCegarLoop]: 70 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, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:40:23,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:40:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 13:40:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-08 13:40:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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-08 13:40:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2025-03-08 13:40:23,964 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 99 [2025-03-08 13:40:23,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:40:23,965 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-03-08 13:40:23,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-08 13:40:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2025-03-08 13:40:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 13:40:23,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:23,970 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, 1, 1, 1, 1] [2025-03-08 13:40:23,978 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-08 13:40:24,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:40:24,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:24,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:24,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1757463018, now seen corresponding path program 1 times [2025-03-08 13:40:24,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:40:24,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875867372] [2025-03-08 13:40:24,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:24,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:40:24,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 13:40:24,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 13:40:24,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:24,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:24,533 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-08 13:40:24,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:40:24,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875867372] [2025-03-08 13:40:24,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875867372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:40:24,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:40:24,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:40:24,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019406124] [2025-03-08 13:40:24,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:40:24,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:40:24,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:40:24,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:40:24,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:40:24,536 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-08 13:40:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:40:24,642 INFO L93 Difference]: Finished difference Result 128 states and 186 transitions. [2025-03-08 13:40:24,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:40:24,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 99 [2025-03-08 13:40:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:40:24,646 INFO L225 Difference]: With dead ends: 128 [2025-03-08 13:40:24,647 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 13:40:24,647 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-08 13:40:24,648 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:40:24,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 190 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:40:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 13:40:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2025-03-08 13:40:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.21875) internal successors, (39), 32 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-08 13:40:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-03-08 13:40:24,658 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 99 [2025-03-08 13:40:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:40:24,659 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-03-08 13:40:24,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-08 13:40:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-03-08 13:40:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 13:40:24,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:24,661 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, 1, 1, 1, 1, 1] [2025-03-08 13:40:24,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:40:24,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:24,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash 495331822, now seen corresponding path program 1 times [2025-03-08 13:40:24,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:40:24,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939257532] [2025-03-08 13:40:24,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:24,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:40:24,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 13:40:24,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 13:40:24,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:24,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:24,747 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-08 13:40:24,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:40:24,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939257532] [2025-03-08 13:40:24,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939257532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:40:24,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:40:24,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:40:24,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411734953] [2025-03-08 13:40:24,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:40:24,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:40:24,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:40:24,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:40:24,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:40:24,760 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-08 13:40:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:40:24,783 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2025-03-08 13:40:24,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:40:24,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 100 [2025-03-08 13:40:24,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:40:24,785 INFO L225 Difference]: With dead ends: 110 [2025-03-08 13:40:24,785 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 13:40:24,785 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-08 13:40:24,786 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 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-08 13:40:24,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:40:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 13:40:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2025-03-08 13:40:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 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-08 13:40:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2025-03-08 13:40:24,796 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 100 [2025-03-08 13:40:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:40:24,797 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2025-03-08 13:40:24,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-08 13:40:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2025-03-08 13:40:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 13:40:24,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:24,798 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, 1, 1, 1, 1, 1] [2025-03-08 13:40:24,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:40:24,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:24,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:24,800 INFO L85 PathProgramCache]: Analyzing trace with hash 523960973, now seen corresponding path program 1 times [2025-03-08 13:40:24,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:40:24,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788736315] [2025-03-08 13:40:24,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:40:24,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 13:40:24,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 13:40:24,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:24,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:40:24,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:40:24,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 13:40:24,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 13:40:24,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:24,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:40:24,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:40:24,958 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:40:24,959 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:40:24,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:40:24,964 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 13:40:25,014 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:40:25,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:40:25 BoogieIcfgContainer [2025-03-08 13:40:25,018 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:40:25,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:40:25,019 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:40:25,019 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:40:25,019 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:23" (3/4) ... [2025-03-08 13:40:25,021 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:40:25,022 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:40:25,022 INFO L158 Benchmark]: Toolchain (without parser) took 2228.61ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 84.1MB in the end (delta: 21.1MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2025-03-08 13:40:25,023 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:40:25,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.04ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 91.8MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:40:25,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.51ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:40:25,023 INFO L158 Benchmark]: Boogie Preprocessor took 40.23ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 86.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:40:25,023 INFO L158 Benchmark]: IcfgBuilder took 314.94ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 70.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:40:25,024 INFO L158 Benchmark]: TraceAbstraction took 1598.90ms. Allocated memory is still 142.6MB. Free memory was 69.2MB in the beginning and 85.0MB in the end (delta: -15.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:40:25,024 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 84.1MB in the end (delta: 930.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:40:25,025 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.14ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.04ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 91.8MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.51ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.23ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 86.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 314.94ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 70.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1598.90ms. Allocated memory is still 142.6MB. Free memory was 69.2MB in the beginning and 85.0MB in the end (delta: -15.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 84.1MB in the end (delta: 930.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 101. 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; VAL [isInitial=0, 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] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] last_1_var_1_12 = var_1_12 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] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0, 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=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, 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=0] [L82] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, 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=0] [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=0, 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=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, 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=0] [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=0, 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=0] [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=0, 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=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, 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=0] [L86] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, 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=0] [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=0, 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=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, 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=0] [L87] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, 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=0] [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=0, 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=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, 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=0] [L89] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, 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=0] [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=0, 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=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, 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=0] [L90] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, 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=0] [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=0, 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=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, 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=0] [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=0, 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=0] [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=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L94] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [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=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L95] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [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=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [L47] var_1_19 = var_1_8 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=0, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [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=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=0, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [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=0, var_1_10=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=0, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [L62] COND TRUE var_1_8 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=0, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [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=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=0, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=0, var_1_9=0] [L69] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=-127, var_1_18=-127, var_1_19=0, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=0, var_1_9=0] [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)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=-127, var_1_18=-127, var_1_19=0, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=0, var_1_9=0] [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=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=-127, var_1_18=-127, var_1_19=0, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=-127, var_1_18=-127, var_1_19=0, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 90 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, 76 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 383 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 249 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 42 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 228 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-08 13:40:25,040 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-?-e2fb8be-m [2025-03-08 13:40:26,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:40:26,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:40:26,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:40:26,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:40:26,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:40:26,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:40:26,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:40:26,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:40:26,998 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:40:26,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:40:26,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:40:26,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:40:26,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:40:26,999 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:40:26,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:40:26,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:40:26,999 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:40:26,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:40:26,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:40:26,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:40:27,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:40:27,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:40:27,000 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:40:27,000 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:40:27,000 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:40:27,000 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:40:27,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:40:27,000 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:40:27,000 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:40:27,000 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:40:27,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:40:27,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:40:27,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:40:27,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:40:27,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:40:27,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:40:27,001 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:40:27,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:40:27,001 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:40:27,001 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:40:27,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:40:27,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:40:27,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:40:27,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:40:27,002 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-08 13:40:27,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:40:27,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:40:27,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:40:27,241 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:40:27,241 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:40:27,242 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-08 13:40:28,444 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6818c0f5f/dcb30cd9f8e140088a32780f5a62eed0/FLAGa91cb8661 [2025-03-08 13:40:28,635 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:40:28,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.i [2025-03-08 13:40:28,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6818c0f5f/dcb30cd9f8e140088a32780f5a62eed0/FLAGa91cb8661 [2025-03-08 13:40:28,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6818c0f5f/dcb30cd9f8e140088a32780f5a62eed0 [2025-03-08 13:40:28,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:40:28,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:40:28,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:40:28,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:40:28,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:40:28,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:28" (1/1) ... [2025-03-08 13:40:28,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@143765cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28, skipping insertion in model container [2025-03-08 13:40:28,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:28" (1/1) ... [2025-03-08 13:40:28,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:40:28,759 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-08 13:40:28,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:40:28,799 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:40:28,806 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-08 13:40:28,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:40:28,836 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:40:28,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28 WrapperNode [2025-03-08 13:40:28,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:40:28,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:40:28,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:40:28,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:40:28,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28" (1/1) ... [2025-03-08 13:40:28,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28" (1/1) ... [2025-03-08 13:40:28,865 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-03-08 13:40:28,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:40:28,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:40:28,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:40:28,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:40:28,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28" (1/1) ... [2025-03-08 13:40:28,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28" (1/1) ... [2025-03-08 13:40:28,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28" (1/1) ... [2025-03-08 13:40:28,888 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:40:28,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28" (1/1) ... [2025-03-08 13:40:28,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28" (1/1) ... [2025-03-08 13:40:28,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28" (1/1) ... [2025-03-08 13:40:28,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28" (1/1) ... [2025-03-08 13:40:28,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28" (1/1) ... [2025-03-08 13:40:28,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28" (1/1) ... [2025-03-08 13:40:28,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:40:28,913 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:40:28,914 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:40:28,914 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:40:28,915 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28" (1/1) ... [2025-03-08 13:40:28,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:40:28,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:40:28,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:40:28,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:40:28,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:40:28,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:40:28,988 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:40:28,988 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:40:28,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:40:28,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:40:29,058 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:40:29,060 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:40:31,176 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 13:40:31,176 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:40:31,183 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:40:31,185 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:40:31,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:31 BoogieIcfgContainer [2025-03-08 13:40:31,185 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:40:31,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:40:31,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:40:31,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:40:31,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:40:28" (1/3) ... [2025-03-08 13:40:31,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681c8d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:31, skipping insertion in model container [2025-03-08 13:40:31,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:28" (2/3) ... [2025-03-08 13:40:31,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681c8d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:31, skipping insertion in model container [2025-03-08 13:40:31,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:31" (3/3) ... [2025-03-08 13:40:31,193 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-73.i [2025-03-08 13:40:31,204 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:40:31,205 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-73.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:40:31,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:40:31,254 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;@799da59c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:40:31,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:40:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 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-08 13:40:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 13:40:31,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:31,266 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, 1, 1, 1, 1] [2025-03-08 13:40:31,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:31,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:31,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2038930029, now seen corresponding path program 1 times [2025-03-08 13:40:31,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:40:31,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266405389] [2025-03-08 13:40:31,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:31,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:31,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:40:31,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:40:31,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:40:31,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 13:40:31,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 13:40:31,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:31,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:31,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:40:31,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:40:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-08 13:40:31,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:40:31,545 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:40:31,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266405389] [2025-03-08 13:40:31,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266405389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:40:31,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:40:31,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:40:31,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598219890] [2025-03-08 13:40:31,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:40:31,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:40:31,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:40:31,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:40:31,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:40:31,569 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 13:40:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:40:31,591 INFO L93 Difference]: Finished difference Result 98 states and 160 transitions. [2025-03-08 13:40:31,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:40:31,593 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2025-03-08 13:40:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:40:31,598 INFO L225 Difference]: With dead ends: 98 [2025-03-08 13:40:31,599 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 13:40:31,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:40:31,606 INFO L435 NwaCegarLoop]: 70 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, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:40:31,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:40:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 13:40:31,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-08 13:40:31,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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-08 13:40:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2025-03-08 13:40:31,656 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 99 [2025-03-08 13:40:31,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:40:31,656 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-03-08 13:40:31,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 13:40:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2025-03-08 13:40:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 13:40:31,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:31,661 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, 1, 1, 1, 1] [2025-03-08 13:40:31,671 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-08 13:40:31,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:31,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:31,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1757463018, now seen corresponding path program 1 times [2025-03-08 13:40:31,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:40:31,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991104065] [2025-03-08 13:40:31,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:31,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:31,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:40:31,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:40:31,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:40:31,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 13:40:32,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 13:40:32,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:32,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:32,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 13:40:32,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:40:32,201 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-08 13:40:32,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:40:32,202 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:40:32,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991104065] [2025-03-08 13:40:32,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991104065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:40:32,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:40:32,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:40:32,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282590844] [2025-03-08 13:40:32,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:40:32,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:40:32,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:40:32,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:40:32,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:40:32,205 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-08 13:40:33,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:40:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:40:34,566 INFO L93 Difference]: Finished difference Result 128 states and 186 transitions. [2025-03-08 13:40:34,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:40:34,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 99 [2025-03-08 13:40:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:40:34,568 INFO L225 Difference]: With dead ends: 128 [2025-03-08 13:40:34,568 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 13:40:34,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 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-08 13:40:34,570 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 62 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 234 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-08 13:40:34,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 234 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 13:40:34,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 13:40:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2025-03-08 13:40:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.21875) internal successors, (39), 32 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-08 13:40:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-03-08 13:40:34,577 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 99 [2025-03-08 13:40:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:40:34,578 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-03-08 13:40:34,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-08 13:40:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-03-08 13:40:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 13:40:34,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:34,579 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, 1, 1, 1, 1, 1] [2025-03-08 13:40:34,586 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-08 13:40:34,780 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-08 13:40:34,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:34,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:34,781 INFO L85 PathProgramCache]: Analyzing trace with hash 495331822, now seen corresponding path program 1 times [2025-03-08 13:40:34,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:40:34,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604062351] [2025-03-08 13:40:34,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:34,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:34,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:40:34,784 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-08 13:40:34,785 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-08 13:40:34,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 13:40:34,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 13:40:34,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:34,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:34,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 13:40:34,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:40:35,018 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-08 13:40:35,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:40:35,019 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:40:35,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604062351] [2025-03-08 13:40:35,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604062351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:40:35,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:40:35,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:40:35,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129903136] [2025-03-08 13:40:35,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:40:35,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:40:35,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:40:35,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:40:35,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:40:35,024 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-08 13:40:36,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:40:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:40:36,618 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2025-03-08 13:40:36,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:40:36,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 100 [2025-03-08 13:40:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:40:36,634 INFO L225 Difference]: With dead ends: 110 [2025-03-08 13:40:36,634 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 13:40:36,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 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-08 13:40:36,635 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 122 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 13:40:36,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 122 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 13:40:36,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 13:40:36,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2025-03-08 13:40:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 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-08 13:40:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2025-03-08 13:40:36,640 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 100 [2025-03-08 13:40:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:40:36,640 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2025-03-08 13:40:36,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-08 13:40:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2025-03-08 13:40:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 13:40:36,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:36,644 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, 1, 1, 1, 1, 1] [2025-03-08 13:40:36,651 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-08 13:40:36,844 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-08 13:40:36,845 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:36,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash 523960973, now seen corresponding path program 1 times [2025-03-08 13:40:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:40:36,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565247943] [2025-03-08 13:40:36,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:36,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:36,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:40:36,851 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-08 13:40:36,853 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-08 13:40:36,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 13:40:37,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 13:40:37,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:37,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:37,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 13:40:37,061 INFO L279 TraceCheckSpWp]: Computing forward predicates...