./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.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 bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:23:09,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:23:09,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:23:09,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:23:09,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:23:09,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:23:09,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:23:09,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:23:09,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:23:09,918 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:23:09,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:23:09,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:23:09,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:23:09,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:23:09,918 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:23:09,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:23:09,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:23:09,918 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:23:09,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:23:09,919 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:23:09,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:23:09,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:23:09,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:23:09,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:23:09,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:23:09,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:23:09,920 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 -> bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 [2025-03-17 04:23:10,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:23:10,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:23:10,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:23:10,164 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:23:10,164 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:23:10,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2025-03-17 04:23:11,315 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d535e232d/aaf4c48bd3104cb2a2c6ec1dab00ae6f/FLAGcb1d6eb4e [2025-03-17 04:23:11,592 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:23:11,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2025-03-17 04:23:11,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d535e232d/aaf4c48bd3104cb2a2c6ec1dab00ae6f/FLAGcb1d6eb4e [2025-03-17 04:23:11,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d535e232d/aaf4c48bd3104cb2a2c6ec1dab00ae6f [2025-03-17 04:23:11,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:23:11,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:23:11,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:23:11,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:23:11,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:23:11,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:23:11" (1/1) ... [2025-03-17 04:23:11,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6812484a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:11, skipping insertion in model container [2025-03-17 04:23:11,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:23:11" (1/1) ... [2025-03-17 04:23:11,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:23:12,017 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_amount10_file-47.i[915,928] [2025-03-17 04:23:12,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:23:12,053 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:23:12,063 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_amount10_file-47.i[915,928] [2025-03-17 04:23:12,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:23:12,085 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:23:12,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:12 WrapperNode [2025-03-17 04:23:12,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:23:12,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:23:12,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:23:12,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:23:12,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:12" (1/1) ... [2025-03-17 04:23:12,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:12" (1/1) ... [2025-03-17 04:23:12,111 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-03-17 04:23:12,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:23:12,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:23:12,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:23:12,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:23:12,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:12" (1/1) ... [2025-03-17 04:23:12,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:12" (1/1) ... [2025-03-17 04:23:12,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:12" (1/1) ... [2025-03-17 04:23:12,136 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:23:12,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:12" (1/1) ... [2025-03-17 04:23:12,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:12" (1/1) ... [2025-03-17 04:23:12,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:12" (1/1) ... [2025-03-17 04:23:12,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:12" (1/1) ... [2025-03-17 04:23:12,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:12" (1/1) ... [2025-03-17 04:23:12,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:12" (1/1) ... [2025-03-17 04:23:12,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:23:12,147 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:23:12,151 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:23:12,152 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:23:12,152 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:12" (1/1) ... [2025-03-17 04:23:12,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:23:12,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:23:12,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:23:12,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:23:12,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:23:12,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:23:12,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:23:12,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:23:12,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:23:12,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:23:12,248 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:23:12,250 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:23:12,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L60: havoc property_#t~bitwise10#1; [2025-03-17 04:23:12,398 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:23:12,398 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:23:12,411 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:23:12,411 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:23:12,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:12 BoogieIcfgContainer [2025-03-17 04:23:12,412 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:23:12,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:23:12,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:23:12,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:23:12,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:23:11" (1/3) ... [2025-03-17 04:23:12,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3396d207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:23:12, skipping insertion in model container [2025-03-17 04:23:12,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:12" (2/3) ... [2025-03-17 04:23:12,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3396d207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:23:12, skipping insertion in model container [2025-03-17 04:23:12,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:12" (3/3) ... [2025-03-17 04:23:12,421 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-47.i [2025-03-17 04:23:12,434 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:23:12,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-47.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:23:12,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:23:12,490 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;@430132af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:23:12,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:23:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 04:23:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 04:23:12,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:12,499 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:23:12,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:12,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:12,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1982343482, now seen corresponding path program 1 times [2025-03-17 04:23:12,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:12,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695499106] [2025-03-17 04:23:12,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:12,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:12,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 04:23:12,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 04:23:12,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:12,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-17 04:23:12,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:23:12,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695499106] [2025-03-17 04:23:12,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695499106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:23:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778679262] [2025-03-17 04:23:12,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:12,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:23:12,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:23:12,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:23:12,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:23:12,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 04:23:12,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 04:23:12,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:12,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:12,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:23:12,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:23:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-17 04:23:12,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:23:12,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778679262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:12,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:23:12,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:23:12,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434078945] [2025-03-17 04:23:12,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:12,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:23:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:23:12,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:23:12,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:23:12,795 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 04:23:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:12,817 INFO L93 Difference]: Finished difference Result 73 states and 117 transitions. [2025-03-17 04:23:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:23:12,819 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 60 [2025-03-17 04:23:12,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:12,824 INFO L225 Difference]: With dead ends: 73 [2025-03-17 04:23:12,824 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 04:23:12,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:23:12,830 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:12,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:23:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 04:23:12,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-17 04:23:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 04:23:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2025-03-17 04:23:12,857 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 60 [2025-03-17 04:23:12,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:12,857 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2025-03-17 04:23:12,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 04:23:12,857 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2025-03-17 04:23:12,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 04:23:12,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:12,859 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:23:12,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:23:13,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:23:13,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:13,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:13,061 INFO L85 PathProgramCache]: Analyzing trace with hash 697112217, now seen corresponding path program 1 times [2025-03-17 04:23:13,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:13,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977763243] [2025-03-17 04:23:13,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:13,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:13,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 04:23:13,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 04:23:13,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:13,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 04:23:13,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:23:13,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977763243] [2025-03-17 04:23:13,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977763243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:13,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:13,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:23:13,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268814055] [2025-03-17 04:23:13,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:13,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:23:13,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:23:13,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:23:13,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:23:13,222 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 04:23:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:13,263 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2025-03-17 04:23:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:23:13,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2025-03-17 04:23:13,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:13,265 INFO L225 Difference]: With dead ends: 72 [2025-03-17 04:23:13,265 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 04:23:13,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:23:13,266 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:13,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:23:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 04:23:13,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 04:23:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 04:23:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2025-03-17 04:23:13,273 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 60 [2025-03-17 04:23:13,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:13,274 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2025-03-17 04:23:13,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 04:23:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2025-03-17 04:23:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 04:23:13,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:13,275 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:23:13,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:23:13,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:13,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2115636392, now seen corresponding path program 1 times [2025-03-17 04:23:13,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:13,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518421824] [2025-03-17 04:23:13,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:13,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:13,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 04:23:13,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 04:23:13,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:13,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 04:23:13,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:23:13,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518421824] [2025-03-17 04:23:13,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518421824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:13,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:13,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:23:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032749367] [2025-03-17 04:23:13,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:13,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:23:13,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:23:13,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:23:13,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:23:13,488 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 04:23:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:13,582 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2025-03-17 04:23:13,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:23:13,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 61 [2025-03-17 04:23:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:13,585 INFO L225 Difference]: With dead ends: 85 [2025-03-17 04:23:13,586 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 04:23:13,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:23:13,587 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:13,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 185 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:23:13,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 04:23:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2025-03-17 04:23:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 04:23:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2025-03-17 04:23:13,591 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 61 [2025-03-17 04:23:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:13,592 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2025-03-17 04:23:13,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 04:23:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2025-03-17 04:23:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 04:23:13,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:13,592 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:23:13,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:23:13,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:13,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash 477701814, now seen corresponding path program 1 times [2025-03-17 04:23:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:13,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029508909] [2025-03-17 04:23:13,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:13,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:23:13,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:23:13,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:13,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:23:13,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:23:13,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:23:13,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:23:13,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:13,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:23:13,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:23:13,673 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:23:13,674 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:23:13,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:23:13,677 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 04:23:13,710 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:23:13,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:23:13 BoogieIcfgContainer [2025-03-17 04:23:13,715 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:23:13,715 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:23:13,715 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:23:13,715 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:23:13,716 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:12" (3/4) ... [2025-03-17 04:23:13,718 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:23:13,719 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:23:13,719 INFO L158 Benchmark]: Toolchain (without parser) took 1821.58ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 62.7MB in the end (delta: 47.9MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2025-03-17 04:23:13,720 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:13,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.17ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 99.0MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:13,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.13ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:13,720 INFO L158 Benchmark]: Boogie Preprocessor took 33.93ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:13,720 INFO L158 Benchmark]: IcfgBuilder took 264.38ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 81.5MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:13,720 INFO L158 Benchmark]: TraceAbstraction took 1301.15ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 62.7MB in the end (delta: 17.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2025-03-17 04:23:13,721 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 142.6MB. Free memory was 62.7MB in the beginning and 62.7MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:13,723 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.47ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.17ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 99.0MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.13ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.93ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 264.38ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 81.5MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1301.15ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 62.7MB in the end (delta: 17.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 142.6MB. Free memory was 62.7MB in the beginning and 62.7MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 55. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 25.25; [L23] signed short int var_1_2 = -25; [L24] signed short int var_1_3 = -500; [L25] unsigned char var_1_4 = 1; [L26] unsigned char var_1_5 = 0; [L27] double var_1_6 = 127.25; [L64] isInitial = 1 [L65] FCALL initially() [L66] COND TRUE 1 [L67] FCALL updateLastVariables() [L68] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_short() [L43] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L43] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L44] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L44] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L45] var_1_3 = __VERIFIER_nondet_short() [L46] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L46] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L47] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L47] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L48] var_1_4 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_5=0, var_1_6=509/4] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_5=0, var_1_6=509/4] [L50] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L50] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L51] var_1_5 = __VERIFIER_nondet_uchar() [L52] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_6=509/4] [L52] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_6=509/4] [L53] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=509/4] [L53] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=509/4] [L54] var_1_6 = __VERIFIER_nondet_double() [L55] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1] [L55] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1] [L68] RET updateVariables() [L69] CALL step() [L31] EXPR var_1_2 & var_1_3 VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1] [L31] COND TRUE (var_1_2 & var_1_3) >= -64 [L32] COND TRUE var_1_2 > var_1_3 VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1] [L33] COND TRUE (var_1_2 > var_1_3) && (var_1_4 || var_1_5) [L34] var_1_1 = var_1_6 VAL [isInitial=1, var_1_1=132, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=132] [L69] RET step() [L70] CALL, EXPR property() [L60] EXPR var_1_2 & var_1_3 VAL [isInitial=1, var_1_1=132, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=132] [L60-L61] return ((var_1_2 & var_1_3) >= -64) ? ((var_1_2 > var_1_3) ? (((var_1_2 > var_1_3) && (var_1_4 || var_1_5)) ? (var_1_1 == ((double) var_1_6)) : (var_1_1 == ((double) var_1_6))) : 1) : 1 ; [L70] RET, EXPR property() [L70] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=132, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=132] [L19] reach_error() VAL [isInitial=1, var_1_1=132, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=132] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 64 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 325 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 184 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 141 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=3, InterpolantAutomatonStates: 11, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 560/576 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 04:23:13,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.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 bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:23:15,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:23:15,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:23:15,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:23:15,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:23:15,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:23:15,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:23:15,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:23:15,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:23:15,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:23:15,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:23:15,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:23:15,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:23:15,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:23:15,821 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:23:15,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:23:15,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:23:15,821 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:23:15,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:23:15,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:23:15,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:23:15,822 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:23:15,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:23:15,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:23:15,823 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:23:15,823 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:23:15,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:23:15,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:23:15,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:23:15,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:23:15,823 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 -> bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 [2025-03-17 04:23:16,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:23:16,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:23:16,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:23:16,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:23:16,044 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:23:16,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2025-03-17 04:23:17,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00dacc67/4acc00fa9f304c5eafe9e3f8d83ae0de/FLAG9ffc0f3d8 [2025-03-17 04:23:17,439 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:23:17,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2025-03-17 04:23:17,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00dacc67/4acc00fa9f304c5eafe9e3f8d83ae0de/FLAG9ffc0f3d8 [2025-03-17 04:23:17,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00dacc67/4acc00fa9f304c5eafe9e3f8d83ae0de [2025-03-17 04:23:17,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:23:17,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:23:17,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:23:17,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:23:17,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:23:17,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:23:17" (1/1) ... [2025-03-17 04:23:17,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14bd088c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17, skipping insertion in model container [2025-03-17 04:23:17,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:23:17" (1/1) ... [2025-03-17 04:23:17,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:23:17,937 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_amount10_file-47.i[915,928] [2025-03-17 04:23:17,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:23:17,965 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:23:17,972 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_amount10_file-47.i[915,928] [2025-03-17 04:23:17,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:23:17,988 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:23:17,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17 WrapperNode [2025-03-17 04:23:17,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:23:17,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:23:17,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:23:17,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:23:17,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17" (1/1) ... [2025-03-17 04:23:17,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17" (1/1) ... [2025-03-17 04:23:18,008 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 66 [2025-03-17 04:23:18,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:23:18,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:23:18,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:23:18,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:23:18,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17" (1/1) ... [2025-03-17 04:23:18,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17" (1/1) ... [2025-03-17 04:23:18,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17" (1/1) ... [2025-03-17 04:23:18,025 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:23:18,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17" (1/1) ... [2025-03-17 04:23:18,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17" (1/1) ... [2025-03-17 04:23:18,031 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17" (1/1) ... [2025-03-17 04:23:18,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17" (1/1) ... [2025-03-17 04:23:18,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17" (1/1) ... [2025-03-17 04:23:18,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17" (1/1) ... [2025-03-17 04:23:18,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:23:18,036 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:23:18,036 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:23:18,036 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:23:18,037 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17" (1/1) ... [2025-03-17 04:23:18,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:23:18,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:23:18,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:23:18,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:23:18,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:23:18,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:23:18,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:23:18,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:23:18,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:23:18,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:23:18,125 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:23:18,127 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:23:18,273 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:23:18,273 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:23:18,283 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:23:18,283 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:23:18,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:18 BoogieIcfgContainer [2025-03-17 04:23:18,284 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:23:18,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:23:18,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:23:18,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:23:18,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:23:17" (1/3) ... [2025-03-17 04:23:18,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@934539e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:23:18, skipping insertion in model container [2025-03-17 04:23:18,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:17" (2/3) ... [2025-03-17 04:23:18,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@934539e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:23:18, skipping insertion in model container [2025-03-17 04:23:18,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:18" (3/3) ... [2025-03-17 04:23:18,293 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-47.i [2025-03-17 04:23:18,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:23:18,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-47.i that has 2 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:23:18,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:23:18,351 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;@252cb5f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:23:18,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:23:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 04:23:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 04:23:18,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:18,362 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:23:18,362 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:18,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:18,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1024403518, now seen corresponding path program 1 times [2025-03-17 04:23:18,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:23:18,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660235191] [2025-03-17 04:23:18,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:18,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:23:18,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:23:18,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:23:18,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 04:23:18,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 04:23:18,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 04:23:18,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:18,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:18,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:23:18,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:23:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-17 04:23:18,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:23:18,497 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:23:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660235191] [2025-03-17 04:23:18,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660235191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:18,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:18,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:23:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126005757] [2025-03-17 04:23:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:18,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:23:18,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:23:18,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:23:18,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:23:18,516 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 04:23:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:18,529 INFO L93 Difference]: Finished difference Result 57 states and 93 transitions. [2025-03-17 04:23:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:23:18,530 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2025-03-17 04:23:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:18,534 INFO L225 Difference]: With dead ends: 57 [2025-03-17 04:23:18,534 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 04:23:18,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:23:18,538 INFO L435 NwaCegarLoop]: 39 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, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:18,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:23:18,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 04:23:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 04:23:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 04:23:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2025-03-17 04:23:18,566 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 56 [2025-03-17 04:23:18,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:18,566 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-03-17 04:23:18,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 04:23:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2025-03-17 04:23:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 04:23:18,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:18,568 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:23:18,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 04:23:18,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:23:18,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:18,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2106039581, now seen corresponding path program 1 times [2025-03-17 04:23:18,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:23:18,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774581043] [2025-03-17 04:23:18,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:18,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:23:18,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:23:18,772 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:23:18,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 04:23:18,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 04:23:18,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 04:23:18,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:18,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:18,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:23:18,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:23:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 04:23:19,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:23:19,000 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:23:19,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774581043] [2025-03-17 04:23:19,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774581043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:19,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:19,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:23:19,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607014848] [2025-03-17 04:23:19,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:19,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:23:19,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:23:19,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:23:19,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:23:19,003 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 04:23:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:19,829 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2025-03-17 04:23:19,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:23:19,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 56 [2025-03-17 04:23:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:19,831 INFO L225 Difference]: With dead ends: 34 [2025-03-17 04:23:19,831 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 04:23:19,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:23:19,832 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:19,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 97 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 04:23:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 04:23:19,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-03-17 04:23:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 04:23:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2025-03-17 04:23:19,836 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 56 [2025-03-17 04:23:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:19,837 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2025-03-17 04:23:19,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 04:23:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2025-03-17 04:23:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 04:23:19,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:19,838 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:23:19,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 04:23:20,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:23:20,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:20,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:20,043 INFO L85 PathProgramCache]: Analyzing trace with hash 861915170, now seen corresponding path program 1 times [2025-03-17 04:23:20,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:23:20,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980053147] [2025-03-17 04:23:20,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:20,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:23:20,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:23:20,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:23:20,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 04:23:20,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 04:23:20,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 04:23:20,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:20,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:20,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 04:23:20,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:23:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 04:23:20,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:23:20,167 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:23:20,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980053147] [2025-03-17 04:23:20,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980053147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:20,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:20,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:23:20,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872422913] [2025-03-17 04:23:20,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:20,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:23:20,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:23:20,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:23:20,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:23:20,168 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 04:23:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:20,355 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2025-03-17 04:23:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:23:20,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 57 [2025-03-17 04:23:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:20,356 INFO L225 Difference]: With dead ends: 38 [2025-03-17 04:23:20,356 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 04:23:20,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:23:20,356 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:20,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 96 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:23:20,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 04:23:20,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2025-03-17 04:23:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 04:23:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2025-03-17 04:23:20,360 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 57 [2025-03-17 04:23:20,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:20,360 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2025-03-17 04:23:20,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 04:23:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2025-03-17 04:23:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 04:23:20,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:20,362 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:23:20,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 04:23:20,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:23:20,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:20,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:20,563 INFO L85 PathProgramCache]: Analyzing trace with hash 948674720, now seen corresponding path program 1 times [2025-03-17 04:23:20,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:23:20,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762593620] [2025-03-17 04:23:20,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:20,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:23:20,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:23:20,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:23:20,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 04:23:20,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 04:23:20,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 04:23:20,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:20,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:20,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 04:23:20,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:23:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 04:23:21,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:23:21,027 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:23:21,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762593620] [2025-03-17 04:23:21,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762593620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:21,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:21,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:23:21,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652178123] [2025-03-17 04:23:21,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:21,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 04:23:21,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:23:21,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 04:23:21,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:23:21,029 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 04:23:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:21,562 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2025-03-17 04:23:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 04:23:21,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 58 [2025-03-17 04:23:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:21,563 INFO L225 Difference]: With dead ends: 42 [2025-03-17 04:23:21,563 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 04:23:21,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-17 04:23:21,564 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:21,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 93 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:23:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 04:23:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 04:23:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 04:23:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 04:23:21,565 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2025-03-17 04:23:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:21,565 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 04:23:21,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 04:23:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 04:23:21,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 04:23:21,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:23:21,572 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 (5)] Ended with exit code 0 [2025-03-17 04:23:21,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:23:21,771 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 04:23:21,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 04:23:22,133 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:23:22,140 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-17 04:23:22,141 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-17 04:23:22,141 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-17 04:23:22,141 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-17 04:23:22,141 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-17 04:23:22,141 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-17 04:23:22,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:23:22 BoogieIcfgContainer [2025-03-17 04:23:22,141 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:23:22,142 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:23:22,142 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:23:22,142 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:23:22,142 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:18" (3/4) ... [2025-03-17 04:23:22,144 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 04:23:22,147 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 04:23:22,149 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 04:23:22,149 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 04:23:22,149 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 04:23:22,150 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 04:23:22,208 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 04:23:22,209 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 04:23:22,209 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:23:22,210 INFO L158 Benchmark]: Toolchain (without parser) took 4378.20ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 59.2MB in the beginning and 40.4MB in the end (delta: 18.8MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2025-03-17 04:23:22,210 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory was 46.5MB in the beginning and 46.3MB in the end (delta: 195.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:22,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.57ms. Allocated memory is still 83.9MB. Free memory was 59.0MB in the beginning and 47.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:22,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.13ms. Allocated memory is still 83.9MB. Free memory was 47.0MB in the beginning and 45.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:22,211 INFO L158 Benchmark]: Boogie Preprocessor took 26.58ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 44.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:22,213 INFO L158 Benchmark]: IcfgBuilder took 247.80ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 54.8MB in the end (delta: -10.8MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2025-03-17 04:23:22,213 INFO L158 Benchmark]: TraceAbstraction took 3855.95ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 54.3MB in the beginning and 47.0MB in the end (delta: 7.3MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2025-03-17 04:23:22,213 INFO L158 Benchmark]: Witness Printer took 67.28ms. Allocated memory is still 100.7MB. Free memory was 47.0MB in the beginning and 40.4MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:22,214 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.23ms. Allocated memory is still 83.9MB. Free memory was 46.5MB in the beginning and 46.3MB in the end (delta: 195.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.57ms. Allocated memory is still 83.9MB. Free memory was 59.0MB in the beginning and 47.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.13ms. Allocated memory is still 83.9MB. Free memory was 47.0MB in the beginning and 45.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.58ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 44.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 247.80ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 54.8MB in the end (delta: -10.8MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3855.95ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 54.3MB in the beginning and 47.0MB in the end (delta: 7.3MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * Witness Printer took 67.28ms. Allocated memory is still 100.7MB. Free memory was 47.0MB in the beginning and 40.4MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 52 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 325 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 139 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 24, 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 566 SizeOfPredicates, 13 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 04:23:22,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE