./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.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 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:41:24,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:41:24,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:41:24,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:41:24,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:41:24,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:41:24,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:41:24,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:41:24,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:41:24,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:41:24,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:41:24,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:41:24,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:41:24,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:41:24,863 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:41:24,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:41:24,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:41:24,864 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:41:24,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:41:24,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:41:24,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:41:24,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:41:24,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:41:24,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:41:24,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:41:24,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:41:24,865 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:41:24,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:41:24,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:41:24,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:41:24,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:41:24,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:41:24,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:41:24,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:41:24,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:41:24,866 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:41:24,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:41:24,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:41:24,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:41:24,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:41:24,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:41:24,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:41:24,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:41:24,866 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 -> 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c [2025-03-17 02:41:25,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:41:25,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:41:25,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:41:25,106 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:41:25,106 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:41:25,108 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-25.i [2025-03-17 02:41:25,626 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6afdfc758/7feed3b322d042db9c9cfcfc26aca78c/FLAG4018bc01b [2025-03-17 02:41:27,290 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:41:27,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i [2025-03-17 02:41:27,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6afdfc758/7feed3b322d042db9c9cfcfc26aca78c/FLAG4018bc01b [2025-03-17 02:41:27,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6afdfc758/7feed3b322d042db9c9cfcfc26aca78c [2025-03-17 02:41:27,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:41:27,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:41:27,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:41:27,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:41:27,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:41:27,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:27" (1/1) ... [2025-03-17 02:41:27,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2a9350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27, skipping insertion in model container [2025-03-17 02:41:27,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:27" (1/1) ... [2025-03-17 02:41:27,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:41:27,439 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-25.i[917,930] [2025-03-17 02:41:27,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:41:27,493 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:41:27,500 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-25.i[917,930] [2025-03-17 02:41:27,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:41:27,535 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:41:27,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27 WrapperNode [2025-03-17 02:41:27,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:41:27,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:41:27,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:41:27,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:41:27,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27" (1/1) ... [2025-03-17 02:41:27,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27" (1/1) ... [2025-03-17 02:41:27,582 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-03-17 02:41:27,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:41:27,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:41:27,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:41:27,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:41:27,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27" (1/1) ... [2025-03-17 02:41:27,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27" (1/1) ... [2025-03-17 02:41:27,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27" (1/1) ... [2025-03-17 02:41:27,612 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:41:27,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27" (1/1) ... [2025-03-17 02:41:27,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27" (1/1) ... [2025-03-17 02:41:27,620 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27" (1/1) ... [2025-03-17 02:41:27,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27" (1/1) ... [2025-03-17 02:41:27,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27" (1/1) ... [2025-03-17 02:41:27,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27" (1/1) ... [2025-03-17 02:41:27,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:41:27,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:41:27,633 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:41:27,633 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:41:27,634 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27" (1/1) ... [2025-03-17 02:41:27,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:41:27,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:41:27,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:41:27,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:41:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:41:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:41:27,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:41:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:41:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:41:27,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:41:27,741 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:41:27,742 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:41:27,959 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 02:41:27,959 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:41:27,968 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:41:27,969 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:41:27,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:27 BoogieIcfgContainer [2025-03-17 02:41:27,969 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:41:27,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:41:27,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:41:27,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:41:27,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:41:27" (1/3) ... [2025-03-17 02:41:27,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7529f508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:27, skipping insertion in model container [2025-03-17 02:41:27,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:27" (2/3) ... [2025-03-17 02:41:27,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7529f508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:27, skipping insertion in model container [2025-03-17 02:41:27,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:27" (3/3) ... [2025-03-17 02:41:27,978 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-25.i [2025-03-17 02:41:27,989 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:41:27,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-25.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:41:28,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:41:28,038 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;@51521253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:41:28,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:41:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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-17 02:41:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 02:41:28,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:41:28,049 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] [2025-03-17 02:41:28,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:41:28,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:41:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash 926816567, now seen corresponding path program 1 times [2025-03-17 02:41:28,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:41:28,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546943548] [2025-03-17 02:41:28,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:41:28,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:41:28,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 02:41:28,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 02:41:28,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:28,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:41:28,266 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-17 02:41:28,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:41:28,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546943548] [2025-03-17 02:41:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546943548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:41:28,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041485546] [2025-03-17 02:41:28,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:41:28,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:41:28,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:41:28,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:41:28,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:41:28,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 02:41:28,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 02:41:28,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:28,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:41:28,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:41:28,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:41:28,422 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-17 02:41:28,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:41:28,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041485546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:41:28,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:41:28,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:41:28,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860481149] [2025-03-17 02:41:28,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:41:28,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:41:28,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:41:28,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:41:28,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:41:28,452 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-17 02:41:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:41:28,473 INFO L93 Difference]: Finished difference Result 97 states and 168 transitions. [2025-03-17 02:41:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:41:28,474 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 111 [2025-03-17 02:41:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:41:28,480 INFO L225 Difference]: With dead ends: 97 [2025-03-17 02:41:28,480 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 02:41:28,484 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-17 02:41:28,486 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:41:28,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:41:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 02:41:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 02:41:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-17 02:41:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2025-03-17 02:41:28,517 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 111 [2025-03-17 02:41:28,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:41:28,518 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 72 transitions. [2025-03-17 02:41:28,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-17 02:41:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2025-03-17 02:41:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 02:41:28,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:41:28,522 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] [2025-03-17 02:41:28,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:41:28,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:41:28,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:41:28,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:41:28,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2009363449, now seen corresponding path program 1 times [2025-03-17 02:41:28,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:41:28,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590593072] [2025-03-17 02:41:28,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:41:28,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:41:28,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 02:41:28,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 02:41:28,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:28,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:41:29,207 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 02:41:29,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:41:29,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590593072] [2025-03-17 02:41:29,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590593072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:41:29,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6364699] [2025-03-17 02:41:29,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:41:29,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:41:29,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:41:29,212 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-17 02:41:29,213 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-17 02:41:29,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 02:41:29,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 02:41:29,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:29,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:41:29,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 02:41:29,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:41:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 02:41:29,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:41:29,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6364699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:41:29,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:41:29,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2025-03-17 02:41:29,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696437247] [2025-03-17 02:41:29,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:41:29,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:41:29,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:41:29,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:41:29,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:41:29,427 INFO L87 Difference]: Start difference. First operand 48 states and 72 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 02:41:29,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:41:29,723 INFO L93 Difference]: Finished difference Result 105 states and 151 transitions. [2025-03-17 02:41:29,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 02:41:29,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2025-03-17 02:41:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:41:29,726 INFO L225 Difference]: With dead ends: 105 [2025-03-17 02:41:29,726 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 02:41:29,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-17 02:41:29,730 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 101 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:41:29,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 131 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:41:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 02:41:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-03-17 02:41:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 02:41:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2025-03-17 02:41:29,745 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 111 [2025-03-17 02:41:29,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:41:29,746 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2025-03-17 02:41:29,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 02:41:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2025-03-17 02:41:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 02:41:29,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:41:29,750 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] [2025-03-17 02:41:29,758 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-17 02:41:29,954 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-17 02:41:29,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:41:29,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:41:29,956 INFO L85 PathProgramCache]: Analyzing trace with hash 557055628, now seen corresponding path program 1 times [2025-03-17 02:41:29,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:41:29,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460040704] [2025-03-17 02:41:29,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:41:29,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:41:29,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 02:41:30,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 02:41:30,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:30,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:41:30,035 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:41:30,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 02:41:30,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 02:41:30,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:30,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:41:30,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:41:30,124 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:41:30,125 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:41:30,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:41:30,129 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 02:41:30,190 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:41:30,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:41:30 BoogieIcfgContainer [2025-03-17 02:41:30,195 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:41:30,196 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:41:30,196 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:41:30,196 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:41:30,197 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:27" (3/4) ... [2025-03-17 02:41:30,198 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:41:30,199 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:41:30,199 INFO L158 Benchmark]: Toolchain (without parser) took 2885.61ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 84.2MB in the end (delta: 36.4MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2025-03-17 02:41:30,200 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-17 02:41:30,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.13ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 107.5MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:41:30,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.67ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 105.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:41:30,201 INFO L158 Benchmark]: Boogie Preprocessor took 44.85ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 103.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:41:30,201 INFO L158 Benchmark]: IcfgBuilder took 338.15ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 87.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:41:30,201 INFO L158 Benchmark]: TraceAbstraction took 2223.79ms. Allocated memory is still 167.8MB. Free memory was 86.3MB in the beginning and 84.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:41:30,202 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 84.2MB in the end (delta: 41.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:41:30,203 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 221.13ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 107.5MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.67ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 105.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.85ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 103.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 338.15ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 87.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2223.79ms. Allocated memory is still 167.8MB. Free memory was 86.3MB in the beginning and 84.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 84.2MB in the end (delta: 41.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 256; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 10; [L25] unsigned short int var_1_4 = 500; [L26] unsigned long int var_1_5 = 0; [L27] unsigned long int var_1_6 = 1509114200; [L28] unsigned long int var_1_7 = 10; [L29] float var_1_8 = 128.9; [L30] float var_1_9 = 63.363; [L31] float var_1_10 = 4.575; [L32] float var_1_11 = 25.5; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L74] var_1_3 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L75] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L76] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L76] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L77] var_1_4 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L79] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L79] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L80] var_1_5 = __VERIFIER_nondet_ulong() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L82] CALL assume_abort_if_not(var_1_5 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L82] RET assume_abort_if_not(var_1_5 <= 1073741823) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L83] var_1_6 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L84] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L86] var_1_7 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_8=1289/10, var_1_9=63363/1000] [L87] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_8=1289/10, var_1_9=63363/1000] [L88] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10, var_1_9=63363/1000] [L88] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10, var_1_9=63363/1000] [L89] var_1_9 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L90] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L91] var_1_10 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L92] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L93] var_1_13 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L94] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L95] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L95] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L96] var_1_14 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L97] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L98] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L98] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L111] RET updateVariables() [L112] CALL step() [L39] COND FALSE !(var_1_9 != var_1_10) [L46] var_1_12 = var_1_14 VAL [isInitial=1, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L48] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=65536, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=65536, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L49] COND TRUE \read(var_1_12) VAL [isInitial=1, stepLocal_0=65536, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=65536, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L50] COND TRUE stepLocal_0 <= var_1_4 [L51] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)) VAL [isInitial=1, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=4294967296, var_1_2=0, var_1_3=65536, var_1_4=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L56] unsigned long int stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_1=4294967296, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=4294967296, var_1_2=0, var_1_3=65536, var_1_4=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1289/10] [L57] COND TRUE var_1_7 >= stepLocal_1 [L58] var_1_8 = ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))) VAL [isInitial=1, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=4294967296, var_1_2=0, var_1_3=65536, var_1_4=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1/2, var_1_9=1/2] [L62] COND TRUE var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8))) [L63] var_1_11 = var_1_10 VAL [isInitial=1, var_1_10=4294967301, var_1_11=4294967301, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=4294967296, var_1_2=0, var_1_3=65536, var_1_4=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1/2, var_1_9=1/2] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((var_1_12 ? ((var_1_3 <= var_1_4) ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)))) : 1) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_7 >= var_1_1) ? (var_1_8 == ((float) ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))))) : (var_1_8 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))))) && ((var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8)))) ? (var_1_11 == ((float) var_1_10)) : ((! (var_1_7 <= var_1_6)) ? (var_1_11 == ((float) var_1_9)) : 1))) && ((var_1_9 != var_1_10) ? ((var_1_2 || var_1_13) ? (var_1_12 == ((unsigned char) (var_1_13 || var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=4294967301, var_1_11=4294967301, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=4294967296, var_1_2=0, var_1_3=65536, var_1_4=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1/2, var_1_9=1/2] [L19] reach_error() VAL [isInitial=1, var_1_10=4294967301, var_1_11=4294967301, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=4294967296, var_1_2=0, var_1_3=65536, var_1_4=0, var_1_5=4294967296, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1/2, var_1_9=1/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 94 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 203 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 149 IncrementalHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 118 mSDtfsCounter, 149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 440 ConstructedInterpolants, 0 QuantifiedInterpolants, 550 SizeOfPredicates, 1 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2411/2448 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 02:41:30,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-25.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 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:41:32,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:41:32,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:41:32,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:41:32,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:41:32,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:41:32,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:41:32,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:41:32,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:41:32,197 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:41:32,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:41:32,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:41:32,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:41:32,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:41:32,198 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:41:32,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:41:32,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:41:32,198 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:41:32,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:41:32,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:41:32,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:41:32,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:41:32,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:41:32,199 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:41:32,199 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:41:32,199 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:41:32,199 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:41:32,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:41:32,199 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:41:32,199 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:41:32,199 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:41:32,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:41:32,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:41:32,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:41:32,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:41:32,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:41:32,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:41:32,200 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:41:32,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:41:32,200 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:41:32,200 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:41:32,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:41:32,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:41:32,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:41:32,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:41:32,201 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 -> 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c [2025-03-17 02:41:32,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:41:32,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:41:32,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:41:32,457 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:41:32,457 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:41:32,459 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-25.i [2025-03-17 02:41:33,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb2f18a4/1ed3e559a769457ead58a5101eba01fb/FLAG28939b8c5 [2025-03-17 02:41:33,819 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:41:33,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i [2025-03-17 02:41:33,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb2f18a4/1ed3e559a769457ead58a5101eba01fb/FLAG28939b8c5 [2025-03-17 02:41:33,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb2f18a4/1ed3e559a769457ead58a5101eba01fb [2025-03-17 02:41:33,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:41:33,845 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:41:33,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:41:33,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:41:33,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:41:33,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:33" (1/1) ... [2025-03-17 02:41:33,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9d8a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:33, skipping insertion in model container [2025-03-17 02:41:33,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:33" (1/1) ... [2025-03-17 02:41:33,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:41:33,968 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-25.i[917,930] [2025-03-17 02:41:34,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:41:34,019 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:41:34,027 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-25.i[917,930] [2025-03-17 02:41:34,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:41:34,061 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:41:34,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:34 WrapperNode [2025-03-17 02:41:34,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:41:34,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:41:34,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:41:34,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:41:34,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:34" (1/1) ... [2025-03-17 02:41:34,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:34" (1/1) ... [2025-03-17 02:41:34,088 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-03-17 02:41:34,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:41:34,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:41:34,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:41:34,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:41:34,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:34" (1/1) ... [2025-03-17 02:41:34,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:34" (1/1) ... [2025-03-17 02:41:34,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:34" (1/1) ... [2025-03-17 02:41:34,111 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:41:34,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:34" (1/1) ... [2025-03-17 02:41:34,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:34" (1/1) ... [2025-03-17 02:41:34,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:34" (1/1) ... [2025-03-17 02:41:34,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:34" (1/1) ... [2025-03-17 02:41:34,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:34" (1/1) ... [2025-03-17 02:41:34,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:34" (1/1) ... [2025-03-17 02:41:34,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:41:34,123 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:41:34,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:41:34,123 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:41:34,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:34" (1/1) ... [2025-03-17 02:41:34,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:41:34,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:41:34,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:41:34,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:41:34,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:41:34,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:41:34,171 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:41:34,171 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:41:34,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:41:34,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:41:34,220 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:41:34,221 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:41:34,456 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 02:41:34,457 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:41:34,469 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:41:34,471 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:41:34,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:34 BoogieIcfgContainer [2025-03-17 02:41:34,471 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:41:34,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:41:34,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:41:34,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:41:34,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:41:33" (1/3) ... [2025-03-17 02:41:34,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8beb1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:34, skipping insertion in model container [2025-03-17 02:41:34,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:34" (2/3) ... [2025-03-17 02:41:34,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8beb1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:34, skipping insertion in model container [2025-03-17 02:41:34,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:34" (3/3) ... [2025-03-17 02:41:34,479 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-25.i [2025-03-17 02:41:34,489 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:41:34,490 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-25.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:41:34,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:41:34,537 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;@f260b91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:41:34,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:41:34,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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-17 02:41:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 02:41:34,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:41:34,551 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] [2025-03-17 02:41:34,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:41:34,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:41:34,556 INFO L85 PathProgramCache]: Analyzing trace with hash 926816567, now seen corresponding path program 1 times [2025-03-17 02:41:34,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:41:34,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495054955] [2025-03-17 02:41:34,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:41:34,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:41:34,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:41:34,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:41:34,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 02:41:34,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 02:41:34,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 02:41:34,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:34,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:41:34,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:41:34,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:41:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-17 02:41:34,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:41:34,804 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:41:34,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495054955] [2025-03-17 02:41:34,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495054955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:41:34,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:41:34,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:41:34,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154582101] [2025-03-17 02:41:34,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:41:34,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:41:34,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:41:34,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:41:34,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:41:34,824 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 02:41:34,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:41:34,847 INFO L93 Difference]: Finished difference Result 97 states and 168 transitions. [2025-03-17 02:41:34,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:41:34,848 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), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2025-03-17 02:41:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:41:34,871 INFO L225 Difference]: With dead ends: 97 [2025-03-17 02:41:34,871 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 02:41:34,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:41:34,878 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:41:34,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:41:34,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 02:41:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 02:41:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-17 02:41:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2025-03-17 02:41:34,916 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 111 [2025-03-17 02:41:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:41:34,916 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 72 transitions. [2025-03-17 02:41:34,917 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), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 02:41:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2025-03-17 02:41:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 02:41:34,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:41:34,920 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] [2025-03-17 02:41:34,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 02:41:35,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:41:35,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:41:35,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:41:35,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2009363449, now seen corresponding path program 1 times [2025-03-17 02:41:35,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:41:35,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654185438] [2025-03-17 02:41:35,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:41:35,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:41:35,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:41:35,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:41:35,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 02:41:35,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 02:41:35,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 02:41:35,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:35,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:41:35,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 02:41:35,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:41:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 02:41:35,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:41:35,494 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:41:35,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654185438] [2025-03-17 02:41:35,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654185438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:41:35,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:41:35,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:41:35,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14013494] [2025-03-17 02:41:35,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:41:35,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:41:35,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:41:35,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:41:35,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:41:35,496 INFO L87 Difference]: Start difference. First operand 48 states and 72 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 02:41:35,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:41:35,846 INFO L93 Difference]: Finished difference Result 105 states and 151 transitions. [2025-03-17 02:41:35,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 02:41:35,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2025-03-17 02:41:35,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:41:35,849 INFO L225 Difference]: With dead ends: 105 [2025-03-17 02:41:35,849 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 02:41:35,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-03-17 02:41:35,850 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 100 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:41:35,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 130 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:41:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 02:41:35,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-03-17 02:41:35,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 02:41:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2025-03-17 02:41:35,858 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 111 [2025-03-17 02:41:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:41:35,859 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2025-03-17 02:41:35,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 02:41:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2025-03-17 02:41:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 02:41:35,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:41:35,861 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] [2025-03-17 02:41:35,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 02:41:36,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:41:36,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:41:36,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:41:36,062 INFO L85 PathProgramCache]: Analyzing trace with hash 557055628, now seen corresponding path program 1 times [2025-03-17 02:41:36,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:41:36,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49263739] [2025-03-17 02:41:36,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:41:36,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:41:36,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:41:36,065 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:41:36,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 02:41:36,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 02:41:36,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 02:41:36,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:36,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:41:36,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 02:41:36,234 INFO L279 TraceCheckSpWp]: Computing forward predicates...