./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.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 59a501260da967ec7da4156f518c44b77b2b3a1718cb97e1e20f43e883a3b147 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:37:39,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:37:39,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:37:39,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:37:39,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:37:39,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:37:39,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:37:39,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:37:39,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:37:39,502 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:37:39,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:37:39,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:37:39,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:37:39,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:37:39,503 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:37:39,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:37:39,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:37:39,504 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:37:39,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:37:39,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:37:39,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:37:39,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:37:39,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:37:39,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:37:39,504 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:37:39,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:37:39,504 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:37:39,504 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:37:39,505 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:37:39,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:37:39,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:37:39,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:37:39,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:37:39,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:37:39,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:37:39,506 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:37:39,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:37:39,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:37:39,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:37:39,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:37:39,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:37:39,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:37:39,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:37:39,506 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 -> 59a501260da967ec7da4156f518c44b77b2b3a1718cb97e1e20f43e883a3b147 [2025-03-08 13:37:39,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:37:39,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:37:39,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:37:39,739 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:37:39,739 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:37:39,741 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-53.i [2025-03-08 13:37:40,919 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7718d0f34/2f081242d12e4adeb8dd457204232ef2/FLAG346e57ea6 [2025-03-08 13:37:41,123 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:37:41,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i [2025-03-08 13:37:41,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7718d0f34/2f081242d12e4adeb8dd457204232ef2/FLAG346e57ea6 [2025-03-08 13:37:41,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7718d0f34/2f081242d12e4adeb8dd457204232ef2 [2025-03-08 13:37:41,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:37:41,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:37:41,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:37:41,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:37:41,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:37:41,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:37:41" (1/1) ... [2025-03-08 13:37:41,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b6fdef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41, skipping insertion in model container [2025-03-08 13:37:41,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:37:41" (1/1) ... [2025-03-08 13:37:41,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:37:41,251 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-53.i[917,930] [2025-03-08 13:37:41,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:37:41,300 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:37:41,308 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-53.i[917,930] [2025-03-08 13:37:41,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:37:41,351 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:37:41,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41 WrapperNode [2025-03-08 13:37:41,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:37:41,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:37:41,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:37:41,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:37:41,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41" (1/1) ... [2025-03-08 13:37:41,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41" (1/1) ... [2025-03-08 13:37:41,390 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2025-03-08 13:37:41,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:37:41,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:37:41,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:37:41,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:37:41,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41" (1/1) ... [2025-03-08 13:37:41,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41" (1/1) ... [2025-03-08 13:37:41,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41" (1/1) ... [2025-03-08 13:37:41,415 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:37:41,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41" (1/1) ... [2025-03-08 13:37:41,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41" (1/1) ... [2025-03-08 13:37:41,419 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41" (1/1) ... [2025-03-08 13:37:41,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41" (1/1) ... [2025-03-08 13:37:41,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41" (1/1) ... [2025-03-08 13:37:41,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41" (1/1) ... [2025-03-08 13:37:41,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:37:41,425 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:37:41,425 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:37:41,425 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:37:41,426 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41" (1/1) ... [2025-03-08 13:37:41,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:37:41,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:37:41,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:37:41,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:37:41,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:37:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:37:41,473 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:37:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:37:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:37:41,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:37:41,528 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:37:41,530 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:37:41,758 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 13:37:41,760 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:37:41,768 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:37:41,769 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:37:41,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:37:41 BoogieIcfgContainer [2025-03-08 13:37:41,769 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:37:41,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:37:41,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:37:41,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:37:41,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:37:41" (1/3) ... [2025-03-08 13:37:41,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6520271b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:37:41, skipping insertion in model container [2025-03-08 13:37:41,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:41" (2/3) ... [2025-03-08 13:37:41,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6520271b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:37:41, skipping insertion in model container [2025-03-08 13:37:41,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:37:41" (3/3) ... [2025-03-08 13:37:41,777 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-53.i [2025-03-08 13:37:41,788 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:37:41,790 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-53.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:37:41,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:37:41,850 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;@658fa336, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:37:41,851 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:37:41,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 13:37:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 13:37:41,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:37:41,864 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:37:41,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:37:41,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:37:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2036206317, now seen corresponding path program 1 times [2025-03-08 13:37:41,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:37:41,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706870733] [2025-03-08 13:37:41,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:41,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:37:41,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 13:37:41,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 13:37:41,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:41,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:37:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 13:37:42,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:37:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706870733] [2025-03-08 13:37:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706870733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:37:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607651875] [2025-03-08 13:37:42,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:42,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:37:42,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:37:42,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:37:42,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:37:42,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 13:37:42,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 13:37:42,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:42,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:37:42,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:37:42,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:37:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 13:37:42,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:37:42,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607651875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:37:42,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:37:42,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:37:42,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994396436] [2025-03-08 13:37:42,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:37:42,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:37:42,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:37:42,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:37:42,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:37:42,245 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 13:37:42,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:37:42,260 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-03-08 13:37:42,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:37:42,262 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-03-08 13:37:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:37:42,266 INFO L225 Difference]: With dead ends: 100 [2025-03-08 13:37:42,266 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 13:37:42,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:37:42,272 INFO L435 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:37:42,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:37:42,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 13:37:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 13:37:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 13:37:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-03-08 13:37:42,301 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 113 [2025-03-08 13:37:42,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:37:42,301 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-03-08 13:37:42,302 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 13:37:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-03-08 13:37:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 13:37:42,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:37:42,304 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:37:42,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 13:37:42,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:37:42,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:37:42,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:37:42,509 INFO L85 PathProgramCache]: Analyzing trace with hash 233659755, now seen corresponding path program 1 times [2025-03-08 13:37:42,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:37:42,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321619245] [2025-03-08 13:37:42,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:42,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:37:42,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 13:37:42,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 13:37:42,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:42,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:37:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-03-08 13:37:43,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:37:43,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321619245] [2025-03-08 13:37:43,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321619245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:37:43,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093706960] [2025-03-08 13:37:43,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:43,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:37:43,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:37:43,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:37:43,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 13:37:43,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 13:37:43,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 13:37:43,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:43,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:37:43,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 13:37:43,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:37:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 218 proven. 147 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-08 13:37:44,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:37:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 156 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-08 13:37:45,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093706960] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:37:45,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 13:37:45,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 15] total 33 [2025-03-08 13:37:45,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042057834] [2025-03-08 13:37:45,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 13:37:45,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 13:37:45,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:37:45,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 13:37:45,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=739, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 13:37:45,468 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 33 states, 31 states have (on average 2.774193548387097) internal successors, (86), 30 states have internal predecessors, (86), 10 states have call successors, (52), 5 states have call predecessors, (52), 12 states have return successors, (53), 9 states have call predecessors, (53), 10 states have call successors, (53) [2025-03-08 13:37:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:37:46,027 INFO L93 Difference]: Finished difference Result 135 states and 181 transitions. [2025-03-08 13:37:46,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 13:37:46,029 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.774193548387097) internal successors, (86), 30 states have internal predecessors, (86), 10 states have call successors, (52), 5 states have call predecessors, (52), 12 states have return successors, (53), 9 states have call predecessors, (53), 10 states have call successors, (53) Word has length 113 [2025-03-08 13:37:46,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:37:46,030 INFO L225 Difference]: With dead ends: 135 [2025-03-08 13:37:46,030 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 13:37:46,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=570, Invalid=1236, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 13:37:46,033 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 141 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:37:46,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 218 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:37:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 13:37:46,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2025-03-08 13:37:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 13:37:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2025-03-08 13:37:46,049 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 113 [2025-03-08 13:37:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:37:46,049 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2025-03-08 13:37:46,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.774193548387097) internal successors, (86), 30 states have internal predecessors, (86), 10 states have call successors, (52), 5 states have call predecessors, (52), 12 states have return successors, (53), 9 states have call predecessors, (53), 10 states have call successors, (53) [2025-03-08 13:37:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2025-03-08 13:37:46,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 13:37:46,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:37:46,055 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:37:46,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 13:37:46,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 13:37:46,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:37:46,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:37:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1312250369, now seen corresponding path program 1 times [2025-03-08 13:37:46,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:37:46,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847662947] [2025-03-08 13:37:46,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:46,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:37:46,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 13:37:46,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 13:37:46,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:46,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:37:46,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:37:46,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 13:37:46,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 13:37:46,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:46,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:37:46,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:37:46,482 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:37:46,483 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:37:46,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:37:46,489 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 13:37:46,540 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:37:46,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:37:46 BoogieIcfgContainer [2025-03-08 13:37:46,543 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:37:46,543 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:37:46,543 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:37:46,543 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:37:46,544 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:37:41" (3/4) ... [2025-03-08 13:37:46,545 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:37:46,546 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:37:46,546 INFO L158 Benchmark]: Toolchain (without parser) took 5406.47ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 119.3MB in the beginning and 362.4MB in the end (delta: -243.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2025-03-08 13:37:46,546 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:37:46,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.62ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 106.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:37:46,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.62ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 103.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:37:46,547 INFO L158 Benchmark]: Boogie Preprocessor took 33.66ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 101.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:37:46,547 INFO L158 Benchmark]: IcfgBuilder took 344.40ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 84.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:37:46,547 INFO L158 Benchmark]: TraceAbstraction took 4771.91ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 83.6MB in the beginning and 362.6MB in the end (delta: -278.9MB). Peak memory consumption was 203.4MB. Max. memory is 16.1GB. [2025-03-08 13:37:46,548 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 411.0MB. Free memory was 362.6MB in the beginning and 362.4MB in the end (delta: 129.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:37:46,548 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.19ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.62ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 106.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.62ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 103.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.66ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 101.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 344.40ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 84.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4771.91ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 83.6MB in the beginning and 362.6MB in the end (delta: -278.9MB). Peak memory consumption was 203.4MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 411.0MB. Free memory was 362.6MB in the beginning and 362.4MB in the end (delta: 129.2kB). 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 someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_3 = 1456677701; [L24] unsigned long int var_1_4 = 1000000000; [L25] unsigned long int var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 0; [L29] double var_1_9 = 256.5; [L30] double var_1_10 = 8.8; [L31] unsigned char var_1_11 = 1; [L32] unsigned short int var_1_12 = 16; [L33] unsigned long int var_1_13 = 3110219175; [L34] unsigned short int var_1_14 = 128; [L35] unsigned char var_1_15 = 1; [L36] unsigned char var_1_16 = 0; VAL [isInitial=0, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] FCALL updateLastVariables() [L107] CALL updateVariables() [L67] var_1_3 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L70] var_1_4 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L72] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L72] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L73] var_1_5 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L74] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L75] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L76] var_1_7 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L80] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L82] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L84] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L85] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L86] var_1_13 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L87] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L88] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L88] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L89] var_1_14 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L90] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L91] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L91] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L93] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L94] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L94] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L107] RET updateVariables() [L108] CALL step() [L40] var_1_6 = var_1_7 VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L41] COND TRUE var_1_5 <= (var_1_13 - var_1_4) [L42] var_1_12 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L44] COND TRUE (var_1_9 * 16.5f) > var_1_10 [L45] var_1_15 = (! var_1_11) VAL [isInitial=1, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L49] var_1_1 = (var_1_12 + (var_1_3 - (var_1_4 - var_1_12))) [L50] signed long int stepLocal_1 = (((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)); [L51] unsigned long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=6442450943, stepLocal_1=65534, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5905711100, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L52] COND TRUE stepLocal_1 != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))) VAL [isInitial=1, stepLocal_0=6442450943, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5905711100, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L53] COND FALSE !(var_1_9 == var_1_10) VAL [isInitial=1, stepLocal_0=6442450943, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5905711100, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L108] RET step() [L109] CALL, EXPR property() [L99-L100] return ((((var_1_1 == ((unsigned long int) (var_1_12 + (var_1_3 - (var_1_4 - var_1_12))))) && (var_1_6 == ((unsigned char) var_1_7))) && ((((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12))) != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) ? ((var_1_9 == var_1_10) ? (var_1_6 ? ((var_1_3 >= var_1_12) ? (var_1_8 == ((unsigned char) (var_1_7 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_7))) : 1) : 1) : (var_1_8 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_13 - var_1_4)) ? (var_1_12 == ((unsigned short int) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))) : 1)) && (((var_1_9 * 16.5f) > var_1_10) ? (var_1_15 == ((unsigned char) (! var_1_11))) : (var_1_15 == ((unsigned char) (var_1_11 && var_1_16)))) ; VAL [\result=0, isInitial=1, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5905711100, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5905711100, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5905711100, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 96 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 291 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 389 IncrementalHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 126 mSDtfsCounter, 389 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=2, InterpolantAutomatonStates: 28, 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, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 560 ConstructedInterpolants, 0 QuantifiedInterpolants, 2949 SizeOfPredicates, 10 NumberOfNonLiveVariables, 520 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 2630/3060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:37:46,562 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-53.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 59a501260da967ec7da4156f518c44b77b2b3a1718cb97e1e20f43e883a3b147 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:37:48,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:37:48,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:37:48,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:37:48,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:37:48,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:37:48,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:37:48,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:37:48,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:37:48,564 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:37:48,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:37:48,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:37:48,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:37:48,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:37:48,564 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:37:48,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:37:48,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:37:48,564 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:37:48,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:37:48,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:37:48,565 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:37:48,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:37:48,565 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:37:48,566 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:37:48,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:37:48,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:37:48,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:37:48,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:37:48,566 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 -> 59a501260da967ec7da4156f518c44b77b2b3a1718cb97e1e20f43e883a3b147 [2025-03-08 13:37:48,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:37:48,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:37:48,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:37:48,937 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:37:48,938 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:37:48,939 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-53.i [2025-03-08 13:37:50,091 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c4b40ad/c076f2d5451140caa80c89625d8cdb66/FLAG94ee74ce9 [2025-03-08 13:37:50,255 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:37:50,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i [2025-03-08 13:37:50,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c4b40ad/c076f2d5451140caa80c89625d8cdb66/FLAG94ee74ce9 [2025-03-08 13:37:50,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c4b40ad/c076f2d5451140caa80c89625d8cdb66 [2025-03-08 13:37:50,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:37:50,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:37:50,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:37:50,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:37:50,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:37:50,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:37:50" (1/1) ... [2025-03-08 13:37:50,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a017bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50, skipping insertion in model container [2025-03-08 13:37:50,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:37:50" (1/1) ... [2025-03-08 13:37:50,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:37:50,762 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-53.i[917,930] [2025-03-08 13:37:50,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:37:50,799 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:37:50,807 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-53.i[917,930] [2025-03-08 13:37:50,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:37:50,836 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:37:50,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50 WrapperNode [2025-03-08 13:37:50,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:37:50,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:37:50,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:37:50,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:37:50,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50" (1/1) ... [2025-03-08 13:37:50,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50" (1/1) ... [2025-03-08 13:37:50,870 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2025-03-08 13:37:50,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:37:50,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:37:50,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:37:50,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:37:50,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50" (1/1) ... [2025-03-08 13:37:50,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50" (1/1) ... [2025-03-08 13:37:50,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50" (1/1) ... [2025-03-08 13:37:50,896 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:37:50,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50" (1/1) ... [2025-03-08 13:37:50,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50" (1/1) ... [2025-03-08 13:37:50,909 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50" (1/1) ... [2025-03-08 13:37:50,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50" (1/1) ... [2025-03-08 13:37:50,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50" (1/1) ... [2025-03-08 13:37:50,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50" (1/1) ... [2025-03-08 13:37:50,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:37:50,920 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:37:50,923 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:37:50,923 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:37:50,924 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50" (1/1) ... [2025-03-08 13:37:50,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:37:50,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:37:50,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:37:50,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:37:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:37:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:37:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:37:50,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:37:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:37:50,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:37:51,027 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:37:51,028 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:37:51,310 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 13:37:51,311 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:37:51,317 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:37:51,317 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:37:51,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:37:51 BoogieIcfgContainer [2025-03-08 13:37:51,318 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:37:51,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:37:51,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:37:51,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:37:51,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:37:50" (1/3) ... [2025-03-08 13:37:51,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f96f6fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:37:51, skipping insertion in model container [2025-03-08 13:37:51,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:50" (2/3) ... [2025-03-08 13:37:51,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f96f6fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:37:51, skipping insertion in model container [2025-03-08 13:37:51,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:37:51" (3/3) ... [2025-03-08 13:37:51,325 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-53.i [2025-03-08 13:37:51,335 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:37:51,336 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-53.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:37:51,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:37:51,379 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;@11c47e43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:37:51,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:37:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 13:37:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 13:37:51,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:37:51,405 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:37:51,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:37:51,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:37:51,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2036206317, now seen corresponding path program 1 times [2025-03-08 13:37:51,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:37:51,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346073051] [2025-03-08 13:37:51,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:51,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:37:51,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:37:51,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:37:51,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:37:51,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 13:37:51,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 13:37:51,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:51,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:37:51,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:37:51,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:37:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-08 13:37:51,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:37:51,646 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:37:51,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346073051] [2025-03-08 13:37:51,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346073051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:37:51,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:37:51,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:37:51,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847478346] [2025-03-08 13:37:51,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:37:51,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:37:51,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:37:51,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:37:51,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:37:51,666 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 13:37:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:37:51,682 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-03-08 13:37:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:37:51,683 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-03-08 13:37:51,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:37:51,689 INFO L225 Difference]: With dead ends: 100 [2025-03-08 13:37:51,690 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 13:37:51,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:37:51,694 INFO L435 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:37:51,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:37:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 13:37:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 13:37:51,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 13:37:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-03-08 13:37:51,720 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 113 [2025-03-08 13:37:51,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:37:51,720 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-03-08 13:37:51,720 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 13:37:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-03-08 13:37:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 13:37:51,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:37:51,723 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:37:51,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 13:37:51,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:37:51,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:37:51,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:37:51,924 INFO L85 PathProgramCache]: Analyzing trace with hash 233659755, now seen corresponding path program 1 times [2025-03-08 13:37:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:37:51,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357777389] [2025-03-08 13:37:51,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:51,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:37:51,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:37:51,927 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:37:51,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:37:51,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 13:37:52,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 13:37:52,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:52,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:37:52,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 13:37:52,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:37:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 80 proven. 168 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 13:37:53,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:37:53,268 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:37:53,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357777389] [2025-03-08 13:37:53,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357777389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:37:53,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1014228617] [2025-03-08 13:37:53,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:53,269 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 13:37:53,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 13:37:53,272 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 13:37:53,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-08 13:37:53,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 13:37:53,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 13:37:53,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:53,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:37:53,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 13:37:53,568 INFO L279 TraceCheckSpWp]: Computing forward predicates...