./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-96.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 5874a29868093144df67f3d9c006a000f3592329fa7366a6687deaedd0fc5b25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:31:12,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:31:12,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:31:12,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:31:12,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:31:12,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:31:12,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:31:12,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:31:12,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:31:12,754 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:31:12,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:31:12,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:31:12,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:31:12,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:31:12,755 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:31:12,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:31:12,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:31:12,756 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:31:12,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:31:12,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:31:12,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:31:12,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:31:12,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:31:12,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:31:12,756 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:31:12,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:31:12,757 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:31:12,757 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:31:12,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:31:12,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:31:12,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:31:12,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:31:12,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:31:12,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:31:12,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:31:12,758 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:31:12,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:31:12,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:31:12,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:31:12,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:31:12,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:31:12,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:31:12,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:31:12,758 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 -> 5874a29868093144df67f3d9c006a000f3592329fa7366a6687deaedd0fc5b25 [2025-03-03 22:31:12,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:31:12,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:31:12,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:31:12,967 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:31:12,968 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:31:12,968 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-96.i [2025-03-03 22:31:14,083 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5982fc69d/7d8c38f9d6e94dd3bf864e9bc02c9d9b/FLAG1a47fadbc [2025-03-03 22:31:14,294 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:31:14,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-96.i [2025-03-03 22:31:14,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5982fc69d/7d8c38f9d6e94dd3bf864e9bc02c9d9b/FLAG1a47fadbc [2025-03-03 22:31:14,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5982fc69d/7d8c38f9d6e94dd3bf864e9bc02c9d9b [2025-03-03 22:31:14,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:31:14,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:31:14,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:31:14,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:31:14,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:31:14,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:31:14" (1/1) ... [2025-03-03 22:31:14,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8651eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14, skipping insertion in model container [2025-03-03 22:31:14,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:31:14" (1/1) ... [2025-03-03 22:31:14,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:31:14,773 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-96.i[917,930] [2025-03-03 22:31:14,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:31:14,829 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:31:14,836 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-96.i[917,930] [2025-03-03 22:31:14,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:31:14,878 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:31:14,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14 WrapperNode [2025-03-03 22:31:14,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:31:14,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:31:14,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:31:14,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:31:14,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14" (1/1) ... [2025-03-03 22:31:14,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14" (1/1) ... [2025-03-03 22:31:14,924 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-03 22:31:14,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:31:14,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:31:14,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:31:14,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:31:14,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14" (1/1) ... [2025-03-03 22:31:14,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14" (1/1) ... [2025-03-03 22:31:14,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14" (1/1) ... [2025-03-03 22:31:14,956 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-03 22:31:14,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14" (1/1) ... [2025-03-03 22:31:14,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14" (1/1) ... [2025-03-03 22:31:14,963 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14" (1/1) ... [2025-03-03 22:31:14,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14" (1/1) ... [2025-03-03 22:31:14,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14" (1/1) ... [2025-03-03 22:31:14,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14" (1/1) ... [2025-03-03 22:31:14,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:31:14,977 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:31:14,977 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:31:14,977 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:31:14,978 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14" (1/1) ... [2025-03-03 22:31:14,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:31:14,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:31:15,002 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-03 22:31:15,004 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-03 22:31:15,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:31:15,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:31:15,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:31:15,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:31:15,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:31:15,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:31:15,076 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:31:15,078 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:31:15,259 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 22:31:15,260 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:31:15,270 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:31:15,270 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:31:15,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:15 BoogieIcfgContainer [2025-03-03 22:31:15,271 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:31:15,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:31:15,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:31:15,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:31:15,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:31:14" (1/3) ... [2025-03-03 22:31:15,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693a7031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:31:15, skipping insertion in model container [2025-03-03 22:31:15,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:14" (2/3) ... [2025-03-03 22:31:15,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693a7031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:31:15, skipping insertion in model container [2025-03-03 22:31:15,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:15" (3/3) ... [2025-03-03 22:31:15,277 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-96.i [2025-03-03 22:31:15,288 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:31:15,290 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-96.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:31:15,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:31:15,342 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;@42e92e94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:31:15,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:31:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 22:31:15,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 22:31:15,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:31:15,353 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:31:15,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:31:15,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:31:15,361 INFO L85 PathProgramCache]: Analyzing trace with hash 659675438, now seen corresponding path program 1 times [2025-03-03 22:31:15,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:31:15,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210165928] [2025-03-03 22:31:15,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:31:15,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:31:15,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 22:31:15,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 22:31:15,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:31:15,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:31:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-03 22:31:15,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:31:15,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210165928] [2025-03-03 22:31:15,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210165928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:31:15,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476053979] [2025-03-03 22:31:15,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:31:15,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:31:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:31:15,557 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-03 22:31:15,558 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-03 22:31:15,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 22:31:15,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 22:31:15,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:31:15,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:31:15,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:31:15,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:31:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-03 22:31:15,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:31:15,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476053979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:31:15,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:31:15,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:31:15,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222721913] [2025-03-03 22:31:15,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:31:15,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:31:15,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:31:15,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:31:15,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:31:15,701 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 22:31:15,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:31:15,715 INFO L93 Difference]: Finished difference Result 96 states and 159 transitions. [2025-03-03 22:31:15,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:31:15,717 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-03-03 22:31:15,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:31:15,721 INFO L225 Difference]: With dead ends: 96 [2025-03-03 22:31:15,721 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 22:31:15,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-03 22:31:15,726 INFO L435 NwaCegarLoop]: 69 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, 69 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-03 22:31:15,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:31:15,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 22:31:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-03 22:31:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 22:31:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-03 22:31:15,755 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 103 [2025-03-03 22:31:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:31:15,755 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-03 22:31:15,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 22:31:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-03 22:31:15,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 22:31:15,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:31:15,758 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:31:15,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:31:15,959 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-03 22:31:15,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:31:15,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:31:15,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1142057036, now seen corresponding path program 1 times [2025-03-03 22:31:15,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:31:15,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364801935] [2025-03-03 22:31:15,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:31:15,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:31:15,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 22:31:16,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 22:31:16,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:31:16,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:31:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 22:31:16,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:31:16,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364801935] [2025-03-03 22:31:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364801935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:31:16,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:31:16,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:31:16,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532218895] [2025-03-03 22:31:16,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:31:16,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:31:16,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:31:16,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:31:16,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:31:16,279 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 22:31:16,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:31:16,388 INFO L93 Difference]: Finished difference Result 148 states and 213 transitions. [2025-03-03 22:31:16,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:31:16,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-03 22:31:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:31:16,389 INFO L225 Difference]: With dead ends: 148 [2025-03-03 22:31:16,389 INFO L226 Difference]: Without dead ends: 103 [2025-03-03 22:31:16,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-03 22:31:16,390 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 66 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:31:16,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 186 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:31:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-03 22:31:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2025-03-03 22:31:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 22:31:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2025-03-03 22:31:16,411 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 103 [2025-03-03 22:31:16,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:31:16,412 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2025-03-03 22:31:16,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 22:31:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2025-03-03 22:31:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 22:31:16,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:31:16,414 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:31:16,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:31:16,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:31:16,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:31:16,415 INFO L85 PathProgramCache]: Analyzing trace with hash -665397427, now seen corresponding path program 1 times [2025-03-03 22:31:16,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:31:16,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631126720] [2025-03-03 22:31:16,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:31:16,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:31:16,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 22:31:16,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 22:31:16,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:31:16,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:31:16,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:31:16,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 22:31:16,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 22:31:16,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:31:16,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:31:16,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:31:16,589 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:31:16,590 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:31:16,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:31:16,593 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 22:31:16,651 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:31:16,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:31:16 BoogieIcfgContainer [2025-03-03 22:31:16,654 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:31:16,654 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:31:16,654 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:31:16,654 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:31:16,655 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:15" (3/4) ... [2025-03-03 22:31:16,656 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:31:16,657 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:31:16,657 INFO L158 Benchmark]: Toolchain (without parser) took 2004.19ms. Allocated memory is still 201.3MB. Free memory was 159.7MB in the beginning and 109.8MB in the end (delta: 49.9MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2025-03-03 22:31:16,658 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:31:16,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.48ms. Allocated memory is still 201.3MB. Free memory was 159.7MB in the beginning and 146.6MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:31:16,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.49ms. Allocated memory is still 201.3MB. Free memory was 146.6MB in the beginning and 144.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:31:16,659 INFO L158 Benchmark]: Boogie Preprocessor took 47.51ms. Allocated memory is still 201.3MB. Free memory was 144.2MB in the beginning and 141.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:31:16,659 INFO L158 Benchmark]: IcfgBuilder took 294.05ms. Allocated memory is still 201.3MB. Free memory was 141.0MB in the beginning and 123.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:31:16,659 INFO L158 Benchmark]: TraceAbstraction took 1381.59ms. Allocated memory is still 201.3MB. Free memory was 122.9MB in the beginning and 109.8MB in the end (delta: 13.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2025-03-03 22:31:16,660 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 201.3MB. Free memory was 109.8MB in the beginning and 109.8MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:31:16,661 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.51ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.48ms. Allocated memory is still 201.3MB. Free memory was 159.7MB in the beginning and 146.6MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.49ms. Allocated memory is still 201.3MB. Free memory was 146.6MB in the beginning and 144.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.51ms. Allocated memory is still 201.3MB. Free memory was 144.2MB in the beginning and 141.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 294.05ms. Allocated memory is still 201.3MB. Free memory was 141.0MB in the beginning and 123.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1381.59ms. Allocated memory is still 201.3MB. Free memory was 122.9MB in the beginning and 109.8MB in the end (delta: 13.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 201.3MB. Free memory was 109.8MB in the beginning and 109.8MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 8; [L25] unsigned short int var_1_4 = 1000; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_9 = 0; [L29] unsigned char var_1_10 = 0; [L30] double var_1_11 = 4.575; [L31] double var_1_13 = 2.75; [L32] double var_1_14 = 128.5; [L33] signed long int var_1_15 = -1000000000; [L34] float var_1_16 = 99999.25; [L35] signed char var_1_17 = 1; [L36] signed char var_1_18 = 50; [L37] unsigned char last_1_var_1_5 = 1; VAL [isInitial=0, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L70] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L71] var_1_3 = __VERIFIER_nondet_ushort() [L72] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L72] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L73] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L74] var_1_4 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_5=1, var_1_6=0, var_1_9=0] [L75] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_5=1, var_1_6=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L77] var_1_6 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L79] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L83] var_1_10 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L85] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L86] var_1_13 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L87] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L88] var_1_14 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L89] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L90] var_1_18 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L91] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L92] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L106] RET updateVariables() [L107] CALL step() [L41] COND FALSE !(! last_1_var_1_5) [L44] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L46] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L47] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L56] var_1_15 = var_1_1 [L57] var_1_16 = var_1_13 [L58] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L59] COND FALSE !(((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) > var_1_15) VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((((! last_1_var_1_5) ? (var_1_1 == ((unsigned short int) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((unsigned short int) var_1_4))) && (var_1_2 ? ((var_1_6 && ((var_1_3 >= 16) || last_1_var_1_5)) ? (var_1_6 ? (var_1_5 == ((unsigned char) ((var_1_1 < var_1_1) && var_1_9))) : (var_1_5 == ((unsigned char) var_1_10))) : 1) : 1)) && ((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) > var_1_15) ? (((var_1_15 / -5) >= ((var_1_4 + var_1_15) - ((((var_1_1) < (var_1_3)) ? (var_1_1) : (var_1_3))))) ? (var_1_11 == ((double) (var_1_13 + var_1_14))) : (var_1_11 == ((double) var_1_14))) : 1)) && (var_1_15 == ((signed long int) var_1_1))) && (var_1_16 == ((float) var_1_13))) && (var_1_17 == ((signed char) var_1_18)) ; VAL [\result=0, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 133 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 306 ConstructedInterpolants, 0 QuantifiedInterpolants, 366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 243 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1410/1440 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-03 22:31:16,674 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-96.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 5874a29868093144df67f3d9c006a000f3592329fa7366a6687deaedd0fc5b25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:31:18,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:31:18,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:31:18,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:31:18,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:31:18,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:31:18,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:31:18,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:31:18,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:31:18,584 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:31:18,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:31:18,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:31:18,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:31:18,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:31:18,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:31:18,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:31:18,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:31:18,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:31:18,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:31:18,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:31:18,586 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:31:18,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:31:18,586 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:31:18,586 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:31:18,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:31:18,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:31:18,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:31:18,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:31:18,586 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 -> 5874a29868093144df67f3d9c006a000f3592329fa7366a6687deaedd0fc5b25 [2025-03-03 22:31:18,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:31:18,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:31:18,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:31:18,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:31:18,843 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:31:18,843 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-96.i [2025-03-03 22:31:19,986 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41bb0b79a/70d2ca64576844da83f17de81d299d5a/FLAG60a1487d1 [2025-03-03 22:31:20,174 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:31:20,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-96.i [2025-03-03 22:31:20,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41bb0b79a/70d2ca64576844da83f17de81d299d5a/FLAG60a1487d1 [2025-03-03 22:31:20,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41bb0b79a/70d2ca64576844da83f17de81d299d5a [2025-03-03 22:31:20,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:31:20,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:31:20,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:31:20,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:31:20,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:31:20,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:31:20" (1/1) ... [2025-03-03 22:31:20,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2713b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20, skipping insertion in model container [2025-03-03 22:31:20,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:31:20" (1/1) ... [2025-03-03 22:31:20,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:31:20,671 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-96.i[917,930] [2025-03-03 22:31:20,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:31:20,709 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:31:20,717 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-96.i[917,930] [2025-03-03 22:31:20,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:31:20,746 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:31:20,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20 WrapperNode [2025-03-03 22:31:20,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:31:20,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:31:20,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:31:20,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:31:20,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 22:31:20,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 22:31:20,780 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-03-03 22:31:20,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:31:20,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:31:20,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:31:20,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:31:20,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 22:31:20,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 22:31:20,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 22:31:20,813 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-03 22:31:20,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 22:31:20,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 22:31:20,819 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 22:31:20,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 22:31:20,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 22:31:20,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 22:31:20,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:31:20,828 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:31:20,828 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:31:20,828 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:31:20,829 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 22:31:20,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:31:20,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:31:20,856 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-03 22:31:20,859 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-03 22:31:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:31:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:31:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:31:20,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:31:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:31:20,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:31:20,930 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:31:20,931 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:31:21,739 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 22:31:21,739 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:31:21,748 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:31:21,748 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:31:21,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:21 BoogieIcfgContainer [2025-03-03 22:31:21,749 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:31:21,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:31:21,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:31:21,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:31:21,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:31:20" (1/3) ... [2025-03-03 22:31:21,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c88d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:31:21, skipping insertion in model container [2025-03-03 22:31:21,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (2/3) ... [2025-03-03 22:31:21,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c88d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:31:21, skipping insertion in model container [2025-03-03 22:31:21,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:21" (3/3) ... [2025-03-03 22:31:21,757 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-96.i [2025-03-03 22:31:21,767 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:31:21,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-96.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:31:21,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:31:21,812 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;@65792b0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:31:21,812 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:31:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 22:31:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 22:31:21,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:31:21,834 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:31:21,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:31:21,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:31:21,838 INFO L85 PathProgramCache]: Analyzing trace with hash 659675438, now seen corresponding path program 1 times [2025-03-03 22:31:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:31:21,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374536359] [2025-03-03 22:31:21,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:31:21,845 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-03 22:31:21,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:31:21,847 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-03 22:31:21,849 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-03 22:31:21,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 22:31:22,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 22:31:22,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:31:22,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:31:22,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:31:22,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:31:22,052 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-03 22:31:22,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:31:22,053 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:31:22,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374536359] [2025-03-03 22:31:22,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374536359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:31:22,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:31:22,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:31:22,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277266227] [2025-03-03 22:31:22,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:31:22,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:31:22,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:31:22,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:31:22,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:31:22,076 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 22:31:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:31:22,094 INFO L93 Difference]: Finished difference Result 96 states and 159 transitions. [2025-03-03 22:31:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:31:22,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-03-03 22:31:22,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:31:22,100 INFO L225 Difference]: With dead ends: 96 [2025-03-03 22:31:22,100 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 22:31:22,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-03 22:31:22,105 INFO L435 NwaCegarLoop]: 69 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, 69 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-03 22:31:22,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:31:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 22:31:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-03 22:31:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 22:31:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-03 22:31:22,137 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 103 [2025-03-03 22:31:22,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:31:22,137 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-03 22:31:22,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 22:31:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-03 22:31:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 22:31:22,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:31:22,140 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:31:22,150 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-03 22:31:22,341 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-03 22:31:22,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:31:22,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:31:22,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1142057036, now seen corresponding path program 1 times [2025-03-03 22:31:22,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:31:22,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619493568] [2025-03-03 22:31:22,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:31:22,342 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-03 22:31:22,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:31:22,347 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-03 22:31:22,348 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-03 22:31:22,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 22:31:22,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 22:31:22,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:31:22,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:31:22,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 22:31:22,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:31:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 22:31:22,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:31:22,861 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:31:22,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619493568] [2025-03-03 22:31:22,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619493568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:31:22,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:31:22,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:31:22,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685160564] [2025-03-03 22:31:22,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:31:22,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:31:22,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:31:22,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:31:22,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:31:22,864 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 22:31:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:31:24,168 INFO L93 Difference]: Finished difference Result 148 states and 213 transitions. [2025-03-03 22:31:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:31:24,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-03 22:31:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:31:24,182 INFO L225 Difference]: With dead ends: 148 [2025-03-03 22:31:24,182 INFO L226 Difference]: Without dead ends: 103 [2025-03-03 22:31:24,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 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-03 22:31:24,183 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:31:24,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 186 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 22:31:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-03 22:31:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2025-03-03 22:31:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 22:31:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2025-03-03 22:31:24,196 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 103 [2025-03-03 22:31:24,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:31:24,196 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2025-03-03 22:31:24,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 22:31:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2025-03-03 22:31:24,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 22:31:24,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:31:24,197 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:31:24,205 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-03 22:31:24,398 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-03 22:31:24,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:31:24,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:31:24,399 INFO L85 PathProgramCache]: Analyzing trace with hash -665397427, now seen corresponding path program 1 times [2025-03-03 22:31:24,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:31:24,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891049125] [2025-03-03 22:31:24,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:31:24,399 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-03 22:31:24,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:31:24,401 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-03 22:31:24,403 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-03 22:31:24,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 22:31:24,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 22:31:24,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:31:24,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:31:24,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 22:31:24,549 INFO L279 TraceCheckSpWp]: Computing forward predicates...