./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.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 8a6163d47f45212f7977b0ec00cda47715422109bdfe89125f498dea9ca08aac --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:33:09,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:33:09,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:33:09,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:33:09,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:33:09,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:33:09,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:33:09,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:33:09,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:33:09,866 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:33:09,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:33:09,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:33:09,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:33:09,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:33:09,867 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:33:09,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:33:09,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:33:09,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:33:09,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:33:09,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:33:09,868 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:33:09,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:33:09,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:33:09,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:33:09,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:33:09,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:33:09,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:33:09,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:33:09,868 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 -> 8a6163d47f45212f7977b0ec00cda47715422109bdfe89125f498dea9ca08aac [2025-03-08 15:33:10,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:33:10,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:33:10,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:33:10,141 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:33:10,141 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:33:10,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i [2025-03-08 15:33:11,379 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93934b5d9/f238dd90e6244aabac5bdca049e58797/FLAG516d1b57e [2025-03-08 15:33:11,643 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:33:11,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i [2025-03-08 15:33:11,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93934b5d9/f238dd90e6244aabac5bdca049e58797/FLAG516d1b57e [2025-03-08 15:33:11,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93934b5d9/f238dd90e6244aabac5bdca049e58797 [2025-03-08 15:33:11,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:33:11,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:33:11,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:33:11,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:33:11,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:33:11,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:33:11" (1/1) ... [2025-03-08 15:33:11,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d119d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:11, skipping insertion in model container [2025-03-08 15:33:11,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:33:11" (1/1) ... [2025-03-08 15:33:11,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:33:12,067 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_operatoramount_amount25_file-43.i[915,928] [2025-03-08 15:33:12,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:33:12,106 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:33:12,115 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_operatoramount_amount25_file-43.i[915,928] [2025-03-08 15:33:12,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:33:12,144 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:33:12,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:12 WrapperNode [2025-03-08 15:33:12,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:33:12,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:33:12,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:33:12,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:33:12,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:12" (1/1) ... [2025-03-08 15:33:12,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:12" (1/1) ... [2025-03-08 15:33:12,181 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-03-08 15:33:12,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:33:12,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:33:12,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:33:12,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:33:12,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:12" (1/1) ... [2025-03-08 15:33:12,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:12" (1/1) ... [2025-03-08 15:33:12,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:12" (1/1) ... [2025-03-08 15:33:12,205 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:33:12,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:12" (1/1) ... [2025-03-08 15:33:12,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:12" (1/1) ... [2025-03-08 15:33:12,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:12" (1/1) ... [2025-03-08 15:33:12,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:12" (1/1) ... [2025-03-08 15:33:12,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:12" (1/1) ... [2025-03-08 15:33:12,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:12" (1/1) ... [2025-03-08 15:33:12,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:33:12,213 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:33:12,213 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:33:12,213 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:33:12,217 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:12" (1/1) ... [2025-03-08 15:33:12,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:33:12,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:33:12,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:33:12,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:33:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:33:12,268 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:33:12,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:33:12,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:33:12,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:33:12,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:33:12,321 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:33:12,323 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:33:12,504 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 15:33:12,505 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:33:12,513 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:33:12,513 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:33:12,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:33:12 BoogieIcfgContainer [2025-03-08 15:33:12,514 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:33:12,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:33:12,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:33:12,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:33:12,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:33:11" (1/3) ... [2025-03-08 15:33:12,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409021b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:33:12, skipping insertion in model container [2025-03-08 15:33:12,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:12" (2/3) ... [2025-03-08 15:33:12,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409021b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:33:12, skipping insertion in model container [2025-03-08 15:33:12,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:33:12" (3/3) ... [2025-03-08 15:33:12,522 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-43.i [2025-03-08 15:33:12,532 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:33:12,533 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-43.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:33:12,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:33:12,583 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;@71f2085a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:33:12,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:33:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 15:33:12,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 15:33:12,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:33:12,596 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:33:12,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:33:12,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:33:12,600 INFO L85 PathProgramCache]: Analyzing trace with hash -541332915, now seen corresponding path program 1 times [2025-03-08 15:33:12,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:33:12,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638748323] [2025-03-08 15:33:12,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:33:12,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:33:12,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 15:33:12,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 15:33:12,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:33:12,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:33:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 15:33:12,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:33:12,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638748323] [2025-03-08 15:33:12,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638748323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:33:12,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126301664] [2025-03-08 15:33:12,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:33:12,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:33:12,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:33:12,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:33:12,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:33:12,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 15:33:12,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 15:33:12,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:33:12,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:33:12,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:33:12,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:33:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 15:33:12,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:33:12,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126301664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:33:12,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:33:12,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:33:12,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014132207] [2025-03-08 15:33:12,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:33:12,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:33:12,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:33:12,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:33:12,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:33:12,991 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 15:33:13,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:33:13,010 INFO L93 Difference]: Finished difference Result 84 states and 133 transitions. [2025-03-08 15:33:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:33:13,012 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2025-03-08 15:33:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:33:13,017 INFO L225 Difference]: With dead ends: 84 [2025-03-08 15:33:13,017 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 15:33:13,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:33:13,021 INFO L435 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:33:13,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:33:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 15:33:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 15:33:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 15:33:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-03-08 15:33:13,051 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 82 [2025-03-08 15:33:13,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:33:13,052 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-08 15:33:13,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 15:33:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-03-08 15:33:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 15:33:13,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:33:13,055 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:33:13,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:33:13,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:33:13,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:33:13,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:33:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1809563413, now seen corresponding path program 1 times [2025-03-08 15:33:13,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:33:13,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854259278] [2025-03-08 15:33:13,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:33:13,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:33:13,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 15:33:13,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 15:33:13,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:33:13,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:33:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 15:33:13,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:33:13,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854259278] [2025-03-08 15:33:13,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854259278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:33:13,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235006224] [2025-03-08 15:33:13,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:33:13,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:33:13,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:33:13,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:33:13,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:33:13,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 15:33:13,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 15:33:13,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:33:13,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:33:13,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 15:33:13,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:33:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-08 15:33:13,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:33:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 15:33:14,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235006224] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:33:14,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:33:14,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-08 15:33:14,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848883961] [2025-03-08 15:33:14,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:33:14,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:33:14,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:33:14,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:33:14,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:33:14,085 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 15:33:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:33:14,270 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2025-03-08 15:33:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:33:14,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 82 [2025-03-08 15:33:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:33:14,274 INFO L225 Difference]: With dead ends: 89 [2025-03-08 15:33:14,274 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 15:33:14,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 161 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:33:14,275 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 110 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:33:14,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 90 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:33:14,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 15:33:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2025-03-08 15:33:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 15:33:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2025-03-08 15:33:14,290 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 82 [2025-03-08 15:33:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:33:14,291 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2025-03-08 15:33:14,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 15:33:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2025-03-08 15:33:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 15:33:14,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:33:14,293 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:33:14,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 15:33:14,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 15:33:14,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:33:14,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:33:14,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1808639892, now seen corresponding path program 1 times [2025-03-08 15:33:14,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:33:14,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598663151] [2025-03-08 15:33:14,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:33:14,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:33:14,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 15:33:14,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 15:33:14,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:33:14,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:33:14,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:33:14,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 15:33:14,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 15:33:14,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:33:14,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:33:14,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:33:14,604 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:33:14,605 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:33:14,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:33:14,610 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 15:33:14,656 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:33:14,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:33:14 BoogieIcfgContainer [2025-03-08 15:33:14,659 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:33:14,659 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:33:14,659 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:33:14,660 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:33:14,660 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:33:12" (3/4) ... [2025-03-08 15:33:14,662 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:33:14,663 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:33:14,664 INFO L158 Benchmark]: Toolchain (without parser) took 2719.44ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 80.4MB in the end (delta: 31.7MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2025-03-08 15:33:14,664 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:33:14,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.99ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:33:14,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.86ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 97.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:33:14,665 INFO L158 Benchmark]: Boogie Preprocessor took 29.85ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 95.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:33:14,666 INFO L158 Benchmark]: IcfgBuilder took 301.42ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 81.1MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 15:33:14,666 INFO L158 Benchmark]: TraceAbstraction took 2142.80ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 80.5MB in the end (delta: 109.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:33:14,667 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 80.4MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:33:14,667 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.99ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.86ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 97.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.85ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 95.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 301.42ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 81.1MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2142.80ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 80.5MB in the end (delta: 109.8kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 80.4MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryArithmeticFLOAToperation at line 48. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] float var_1_4 = 64.4; [L24] float var_1_5 = 0.2; [L25] double var_1_8 = 31.75; [L26] double var_1_9 = 50.375; [L27] double var_1_10 = 99.25; [L28] double var_1_11 = 16.4; [L29] double var_1_12 = 64.5; [L30] float var_1_13 = 8.75; [L31] float var_1_14 = 127.1; [L32] unsigned short int var_1_15 = 5; [L33] unsigned char var_1_18 = 0; [L34] unsigned char var_1_19 = 0; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 8; [L37] double last_1_var_1_8 = 31.75; VAL [isInitial=0, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_4=322/5, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L86] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_4=322/5, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L63] var_1_4 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L64] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L65] var_1_5 = __VERIFIER_nondet_float() [L66] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4, var_1_9=403/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4, var_1_9=403/8] [L66] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4, var_1_9=403/8] [L67] var_1_9 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L68] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L69] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L69] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L70] var_1_10 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L71] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L72] var_1_11 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L73] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L74] var_1_12 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L75] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L76] var_1_14 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L77] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L78] var_1_19 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L79] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L80] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L80] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L81] var_1_21 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_8=127/4] [L82] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_8=127/4] [L83] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=254, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=254, var_1_8=127/4] [L83] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=254, var_1_8=127/4] [L97] RET updateVariables() [L98] CALL step() [L41] COND FALSE !((- (var_1_5 / var_1_9)) != last_1_var_1_8) [L46] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=254, var_1_8=259] [L48] var_1_13 = (128.75f + var_1_14) [L49] var_1_18 = var_1_19 [L50] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=254, var_1_21=254, var_1_8=259] [L51] COND FALSE !(var_1_13 != ((((var_1_13) > ((var_1_4 - var_1_5))) ? (var_1_13) : ((var_1_4 - var_1_5))))) [L56] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] [L58] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] [L98] RET step() [L99] CALL, EXPR property() [L89-L90] return ((((((var_1_13 != ((((var_1_13) > ((var_1_4 - var_1_5))) ? (var_1_13) : ((var_1_4 - var_1_5))))) ? (var_1_18 ? (var_1_1 == ((signed short int) var_1_20)) : 1) : (var_1_1 == ((signed short int) var_1_20))) && (((- (var_1_5 / var_1_9)) != last_1_var_1_8) ? ((var_1_4 != (- var_1_9)) ? (var_1_8 == ((double) ((var_1_10 + var_1_11) - var_1_12))) : 1) : (var_1_8 == ((double) var_1_12)))) && (var_1_13 == ((float) (128.75f + var_1_14)))) && (var_1_18 ? (var_1_15 == ((unsigned short int) (var_1_20 + var_1_20))) : 1)) && (var_1_18 == ((unsigned char) var_1_19))) && (var_1_20 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 75 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 97 mSDtfsCounter, 81 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 244 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 579 SizeOfPredicates, 2 NumberOfNonLiveVariables, 408 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1280/1320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 15:33:14,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.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 8a6163d47f45212f7977b0ec00cda47715422109bdfe89125f498dea9ca08aac --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:33:16,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:33:16,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:33:16,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:33:16,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:33:16,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:33:16,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:33:16,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:33:16,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:33:16,613 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:33:16,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:33:16,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:33:16,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:33:16,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:33:16,614 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:33:16,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:33:16,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:33:16,615 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:33:16,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:33:16,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:33:16,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:33:16,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:33:16,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:33:16,616 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:33:16,616 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:33:16,616 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:33:16,616 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:33:16,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:33:16,616 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:33:16,616 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:33:16,616 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:33:16,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:33:16,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:33:16,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:33:16,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:33:16,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:33:16,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:33:16,617 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:33:16,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:33:16,618 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:33:16,618 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:33:16,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:33:16,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:33:16,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:33:16,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:33:16,618 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 -> 8a6163d47f45212f7977b0ec00cda47715422109bdfe89125f498dea9ca08aac [2025-03-08 15:33:16,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:33:16,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:33:16,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:33:16,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:33:16,878 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:33:16,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i [2025-03-08 15:33:18,056 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b7ccfdd/e29f74b608564d1cbeeeead117fae457/FLAG18b39806b [2025-03-08 15:33:18,250 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:33:18,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i [2025-03-08 15:33:18,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b7ccfdd/e29f74b608564d1cbeeeead117fae457/FLAG18b39806b [2025-03-08 15:33:18,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b7ccfdd/e29f74b608564d1cbeeeead117fae457 [2025-03-08 15:33:18,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:33:18,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:33:18,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:33:18,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:33:18,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:33:18,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:33:18" (1/1) ... [2025-03-08 15:33:18,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ebd0b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18, skipping insertion in model container [2025-03-08 15:33:18,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:33:18" (1/1) ... [2025-03-08 15:33:18,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:33:18,413 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_operatoramount_amount25_file-43.i[915,928] [2025-03-08 15:33:18,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:33:18,470 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:33:18,479 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_operatoramount_amount25_file-43.i[915,928] [2025-03-08 15:33:18,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:33:18,518 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:33:18,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18 WrapperNode [2025-03-08 15:33:18,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:33:18,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:33:18,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:33:18,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:33:18,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18" (1/1) ... [2025-03-08 15:33:18,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18" (1/1) ... [2025-03-08 15:33:18,556 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-03-08 15:33:18,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:33:18,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:33:18,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:33:18,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:33:18,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18" (1/1) ... [2025-03-08 15:33:18,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18" (1/1) ... [2025-03-08 15:33:18,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18" (1/1) ... [2025-03-08 15:33:18,586 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:33:18,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18" (1/1) ... [2025-03-08 15:33:18,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18" (1/1) ... [2025-03-08 15:33:18,596 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18" (1/1) ... [2025-03-08 15:33:18,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18" (1/1) ... [2025-03-08 15:33:18,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18" (1/1) ... [2025-03-08 15:33:18,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18" (1/1) ... [2025-03-08 15:33:18,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:33:18,610 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:33:18,610 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:33:18,610 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:33:18,611 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18" (1/1) ... [2025-03-08 15:33:18,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:33:18,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:33:18,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:33:18,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:33:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:33:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:33:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:33:18,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:33:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:33:18,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:33:18,737 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:33:18,739 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:33:34,296 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 15:33:34,296 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:33:34,303 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:33:34,303 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:33:34,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:33:34 BoogieIcfgContainer [2025-03-08 15:33:34,304 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:33:34,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:33:34,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:33:34,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:33:34,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:33:18" (1/3) ... [2025-03-08 15:33:34,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ae330e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:33:34, skipping insertion in model container [2025-03-08 15:33:34,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:33:18" (2/3) ... [2025-03-08 15:33:34,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ae330e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:33:34, skipping insertion in model container [2025-03-08 15:33:34,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:33:34" (3/3) ... [2025-03-08 15:33:34,311 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-43.i [2025-03-08 15:33:34,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:33:34,323 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-43.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:33:34,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:33:34,363 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;@3a9b411, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:33:34,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:33:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 15:33:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 15:33:34,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:33:34,385 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:33:34,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:33:34,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:33:34,392 INFO L85 PathProgramCache]: Analyzing trace with hash -541332915, now seen corresponding path program 1 times [2025-03-08 15:33:34,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:33:34,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001037613] [2025-03-08 15:33:34,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:33:34,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:33:34,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:33:34,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:33:34,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 15:33:34,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 15:33:35,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 15:33:35,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:33:35,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:33:35,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:33:35,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:33:35,346 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-08 15:33:35,347 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:33:35,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:33:35,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001037613] [2025-03-08 15:33:35,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001037613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:33:35,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:33:35,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:33:35,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089324300] [2025-03-08 15:33:35,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:33:35,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:33:35,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:33:35,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:33:35,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:33:35,370 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 15:33:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:33:35,383 INFO L93 Difference]: Finished difference Result 84 states and 133 transitions. [2025-03-08 15:33:35,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:33:35,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2025-03-08 15:33:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:33:35,388 INFO L225 Difference]: With dead ends: 84 [2025-03-08 15:33:35,388 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 15:33:35,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:33:35,395 INFO L435 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:33:35,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:33:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 15:33:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 15:33:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 15:33:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-03-08 15:33:35,423 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 82 [2025-03-08 15:33:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:33:35,424 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-08 15:33:35,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 15:33:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-03-08 15:33:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 15:33:35,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:33:35,427 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:33:35,455 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-08 15:33:35,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:33:35,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:33:35,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:33:35,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1809563413, now seen corresponding path program 1 times [2025-03-08 15:33:35,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:33:35,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739558039] [2025-03-08 15:33:35,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:33:35,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:33:35,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:33:35,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:33:35,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 15:33:35,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 15:33:36,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 15:33:36,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:33:36,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:33:36,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 15:33:36,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:33:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-08 15:33:37,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:33:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 15:33:40,050 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:33:40,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739558039] [2025-03-08 15:33:40,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739558039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:33:40,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:33:40,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-08 15:33:40,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334101858] [2025-03-08 15:33:40,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:33:40,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:33:40,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:33:40,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:33:40,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:33:40,052 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 15:33:47,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:33:51,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:33:55,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:33:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:33:55,033 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2025-03-08 15:33:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:33:55,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 82 [2025-03-08 15:33:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:33:55,178 INFO L225 Difference]: With dead ends: 89 [2025-03-08 15:33:55,178 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 15:33:55,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:33:55,179 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 109 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 75 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:33:55,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 90 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 13.9s Time] [2025-03-08 15:33:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 15:33:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2025-03-08 15:33:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 15:33:55,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2025-03-08 15:33:55,186 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 82 [2025-03-08 15:33:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:33:55,187 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2025-03-08 15:33:55,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 15:33:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2025-03-08 15:33:55,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 15:33:55,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:33:55,188 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:33:55,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 15:33:55,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:33:55,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:33:55,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:33:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1808639892, now seen corresponding path program 1 times [2025-03-08 15:33:55,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:33:55,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237784875] [2025-03-08 15:33:55,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:33:55,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:33:55,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:33:55,391 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:33:55,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 15:33:55,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 15:33:56,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 15:33:56,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:33:56,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:33:56,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 15:33:56,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:34:13,407 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:34:23,486 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:34:31,775 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:34:39,944 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:34:48,448 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:34:52,533 WARN L851 $PredicateComparison]: unable to prove that (and (bvsle ((_ zero_extend 24) c_~var_1_19~0) (_ bv0 32)) (fp.geq c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (= c_~var_1_8~0 c_~var_1_12~0) (fp.eq (fp.neg (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0) c_~var_1_9~0)) c_~last_1_var_1_8~0) (fp.leq c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2025-03-08 15:34:56,696 WARN L873 $PredicateComparison]: unable to prove that (and (bvsle ((_ zero_extend 24) c_~var_1_19~0) (_ bv0 32)) (fp.geq c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (= c_~var_1_8~0 c_~var_1_12~0) (fp.eq (fp.neg (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0) c_~var_1_9~0)) c_~last_1_var_1_8~0) (fp.leq c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true