./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.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-94.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 daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:25:16,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:25:16,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:25:16,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:25:16,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:25:16,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:25:16,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:25:16,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:25:16,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:25:16,253 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:25:16,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:25:16,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:25:16,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:25:16,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:25:16,254 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:25:16,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:25:16,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:25:16,254 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:25:16,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:25:16,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:25:16,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:25:16,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:25:16,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:25:16,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:25:16,255 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:25:16,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:25:16,255 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:25:16,255 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:25:16,255 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:25:16,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:25:16,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:25:16,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:25:16,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:25:16,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:25:16,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:25:16,256 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:25:16,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:25:16,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:25:16,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:25:16,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:25:16,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:25:16,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:25:16,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:25:16,256 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 -> daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff [2025-03-17 04:25:16,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:25:16,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:25:16,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:25:16,474 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:25:16,474 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:25:16,475 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-94.i [2025-03-17 04:25:17,708 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc261e922/94be9ba889d543669c6f94a3b4b78884/FLAG3731bd183 [2025-03-17 04:25:17,942 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:25:17,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i [2025-03-17 04:25:17,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc261e922/94be9ba889d543669c6f94a3b4b78884/FLAG3731bd183 [2025-03-17 04:25:17,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc261e922/94be9ba889d543669c6f94a3b4b78884 [2025-03-17 04:25:17,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:25:17,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:25:17,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:25:17,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:25:17,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:25:17,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:25:17" (1/1) ... [2025-03-17 04:25:17,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc1e061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:17, skipping insertion in model container [2025-03-17 04:25:17,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:25:17" (1/1) ... [2025-03-17 04:25:17,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:25:18,094 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-94.i[915,928] [2025-03-17 04:25:18,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:25:18,130 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:25:18,139 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-94.i[915,928] [2025-03-17 04:25:18,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:25:18,165 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:25:18,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:18 WrapperNode [2025-03-17 04:25:18,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:25:18,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:25:18,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:25:18,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:25:18,171 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:25:18" (1/1) ... [2025-03-17 04:25:18,177 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:25:18" (1/1) ... [2025-03-17 04:25:18,197 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2025-03-17 04:25:18,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:25:18,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:25:18,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:25:18,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:25:18,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:18" (1/1) ... [2025-03-17 04:25:18,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:18" (1/1) ... [2025-03-17 04:25:18,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:18" (1/1) ... [2025-03-17 04:25:18,232 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:25:18,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:18" (1/1) ... [2025-03-17 04:25:18,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:18" (1/1) ... [2025-03-17 04:25:18,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:18" (1/1) ... [2025-03-17 04:25:18,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:18" (1/1) ... [2025-03-17 04:25:18,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:18" (1/1) ... [2025-03-17 04:25:18,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:18" (1/1) ... [2025-03-17 04:25:18,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:25:18,250 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:25:18,250 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:25:18,251 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:25:18,251 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:18" (1/1) ... [2025-03-17 04:25:18,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:25:18,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:18,275 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:25:18,277 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:25:18,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:25:18,294 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:25:18,294 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:25:18,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:25:18,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:25:18,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:25:18,337 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:25:18,338 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:25:18,463 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L58: havoc property_#t~bitwise10#1;havoc property_#t~short11#1; [2025-03-17 04:25:18,476 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 04:25:18,477 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:25:18,495 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:25:18,495 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:25:18,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:18 BoogieIcfgContainer [2025-03-17 04:25:18,495 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:25:18,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:25:18,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:25:18,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:25:18,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:25:17" (1/3) ... [2025-03-17 04:25:18,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc3477d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:25:18, skipping insertion in model container [2025-03-17 04:25:18,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:18" (2/3) ... [2025-03-17 04:25:18,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc3477d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:25:18, skipping insertion in model container [2025-03-17 04:25:18,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:18" (3/3) ... [2025-03-17 04:25:18,505 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-94.i [2025-03-17 04:25:18,516 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:25:18,517 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-94.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:25:18,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:25:18,571 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;@1a083021, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:25:18,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:25:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:25:18,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 04:25:18,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:18,582 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:18,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:18,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:18,587 INFO L85 PathProgramCache]: Analyzing trace with hash 884522123, now seen corresponding path program 1 times [2025-03-17 04:25:18,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:18,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642435] [2025-03-17 04:25:18,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:18,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:18,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 04:25:18,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 04:25:18,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:18,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 04:25:18,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:18,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642435] [2025-03-17 04:25:18,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:25:18,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070023803] [2025-03-17 04:25:18,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:18,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:18,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:18,768 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:25:18,769 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:25:18,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 04:25:18,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 04:25:18,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:18,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:18,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:25:18,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 04:25:18,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:25:18,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070023803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:18,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:25:18,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:25:18,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549296713] [2025-03-17 04:25:18,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:18,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:25:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:18,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:25:18,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:25:18,891 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:25:18,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:18,912 INFO L93 Difference]: Finished difference Result 73 states and 114 transitions. [2025-03-17 04:25:18,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:25:18,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 66 [2025-03-17 04:25:18,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:18,919 INFO L225 Difference]: With dead ends: 73 [2025-03-17 04:25:18,919 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 04:25:18,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 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:25:18,926 INFO L435 NwaCegarLoop]: 47 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, 47 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:25:18,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:25:18,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 04:25:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-17 04:25:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:25:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-17 04:25:18,963 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 66 [2025-03-17 04:25:18,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:18,963 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-17 04:25:18,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:25:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-17 04:25:18,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 04:25:18,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:18,965 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:18,971 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:25:19,166 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:25:19,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:19,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:19,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2115310293, now seen corresponding path program 1 times [2025-03-17 04:25:19,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:19,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637030208] [2025-03-17 04:25:19,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:19,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 04:25:19,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 04:25:19,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:19,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 04:25:19,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:19,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637030208] [2025-03-17 04:25:19,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637030208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:19,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:19,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:25:19,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198543108] [2025-03-17 04:25:19,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:19,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:25:19,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:19,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:25:19,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:25:19,806 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:25:19,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:19,891 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2025-03-17 04:25:19,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:25:19,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2025-03-17 04:25:19,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:19,893 INFO L225 Difference]: With dead ends: 72 [2025-03-17 04:25:19,893 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 04:25:19,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:25:19,894 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:19,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:25:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 04:25:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2025-03-17 04:25:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:25:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-03-17 04:25:19,898 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 66 [2025-03-17 04:25:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:19,899 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-03-17 04:25:19,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:25:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-03-17 04:25:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 04:25:19,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:19,902 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:19,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:25:19,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:19,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2120059895, now seen corresponding path program 1 times [2025-03-17 04:25:19,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:19,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700268087] [2025-03-17 04:25:19,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:19,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:19,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 04:25:19,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 04:25:19,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:19,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 04:25:20,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:20,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700268087] [2025-03-17 04:25:20,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700268087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:20,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:20,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:25:20,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836069468] [2025-03-17 04:25:20,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:20,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:25:20,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:20,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:25:20,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:25:20,134 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:25:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:20,215 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2025-03-17 04:25:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:25:20,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 68 [2025-03-17 04:25:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:20,216 INFO L225 Difference]: With dead ends: 48 [2025-03-17 04:25:20,217 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 04:25:20,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:25:20,218 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:20,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 203 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:25:20,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 04:25:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2025-03-17 04:25:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:25:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2025-03-17 04:25:20,226 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 68 [2025-03-17 04:25:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:20,226 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2025-03-17 04:25:20,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:25:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2025-03-17 04:25:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 04:25:20,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:20,232 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:20,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:25:20,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:20,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:20,233 INFO L85 PathProgramCache]: Analyzing trace with hash 367452938, now seen corresponding path program 1 times [2025-03-17 04:25:20,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:20,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524469401] [2025-03-17 04:25:20,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:20,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:20,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 04:25:20,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 04:25:20,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:20,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 04:25:20,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:20,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524469401] [2025-03-17 04:25:20,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524469401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:20,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:20,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:25:20,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728982308] [2025-03-17 04:25:20,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:20,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:25:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:20,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:25:20,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:25:20,507 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:25:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:20,694 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2025-03-17 04:25:20,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:25:20,694 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 68 [2025-03-17 04:25:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:20,695 INFO L225 Difference]: With dead ends: 71 [2025-03-17 04:25:20,695 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 04:25:20,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:25:20,696 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:20,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 345 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:25:20,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 04:25:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2025-03-17 04:25:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 52 states have internal predecessors, (59), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 04:25:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2025-03-17 04:25:20,708 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 68 [2025-03-17 04:25:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:20,709 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2025-03-17 04:25:20,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:25:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2025-03-17 04:25:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 04:25:20,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:20,711 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:20,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:25:20,711 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:20,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:20,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1464811455, now seen corresponding path program 1 times [2025-03-17 04:25:20,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:20,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235066133] [2025-03-17 04:25:20,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:20,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:20,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 04:25:20,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 04:25:20,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:20,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 04:25:20,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:20,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235066133] [2025-03-17 04:25:20,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235066133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:20,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:20,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:25:20,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072122585] [2025-03-17 04:25:20,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:20,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:25:20,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:20,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:25:20,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:25:20,790 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:25:20,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:20,827 INFO L93 Difference]: Finished difference Result 148 states and 183 transitions. [2025-03-17 04:25:20,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:25:20,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2025-03-17 04:25:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:20,829 INFO L225 Difference]: With dead ends: 148 [2025-03-17 04:25:20,829 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 04:25:20,829 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:25:20,830 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 17 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:20,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 87 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:25:20,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 04:25:20,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2025-03-17 04:25:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.14) internal successors, (57), 51 states have internal predecessors, (57), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 04:25:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2025-03-17 04:25:20,842 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 69 [2025-03-17 04:25:20,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:20,843 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-03-17 04:25:20,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:25:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2025-03-17 04:25:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 04:25:20,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:20,844 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:20,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:25:20,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:20,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:20,844 INFO L85 PathProgramCache]: Analyzing trace with hash -705090938, now seen corresponding path program 1 times [2025-03-17 04:25:20,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:20,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69378391] [2025-03-17 04:25:20,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:20,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:20,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 04:25:20,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 04:25:20,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:20,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 04:25:20,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:20,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69378391] [2025-03-17 04:25:20,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69378391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:20,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:20,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:25:20,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959844487] [2025-03-17 04:25:20,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:20,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:25:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:20,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:25:20,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:25:20,915 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:25:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:20,943 INFO L93 Difference]: Finished difference Result 130 states and 160 transitions. [2025-03-17 04:25:20,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:25:20,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2025-03-17 04:25:20,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:20,945 INFO L225 Difference]: With dead ends: 130 [2025-03-17 04:25:20,945 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 04:25:20,945 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:25:20,947 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:20,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 86 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:25:20,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 04:25:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2025-03-17 04:25:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:25:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2025-03-17 04:25:20,956 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 69 [2025-03-17 04:25:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:20,956 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2025-03-17 04:25:20,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:25:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2025-03-17 04:25:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 04:25:20,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:20,957 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:20,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:25:20,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:20,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash -353933243, now seen corresponding path program 1 times [2025-03-17 04:25:20,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:20,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499172612] [2025-03-17 04:25:20,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:20,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:20,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 04:25:20,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 04:25:20,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:20,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:25:20,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:25:20,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 04:25:21,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 04:25:21,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:21,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:25:21,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:25:21,029 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:25:21,030 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:25:21,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:25:21,033 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:25:21,078 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:25:21,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:25:21 BoogieIcfgContainer [2025-03-17 04:25:21,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:25:21,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:25:21,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:25:21,081 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:25:21,085 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:18" (3/4) ... [2025-03-17 04:25:21,086 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:25:21,087 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:25:21,088 INFO L158 Benchmark]: Toolchain (without parser) took 3121.29ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 47.1MB in the end (delta: 75.7MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. [2025-03-17 04:25:21,088 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:21,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.31ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 110.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:21,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.34ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 108.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:21,088 INFO L158 Benchmark]: Boogie Preprocessor took 46.88ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:21,088 INFO L158 Benchmark]: IcfgBuilder took 245.23ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 91.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 04:25:21,092 INFO L158 Benchmark]: TraceAbstraction took 2581.77ms. Allocated memory is still 167.8MB. Free memory was 90.5MB in the beginning and 47.1MB in the end (delta: 43.4MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:21,093 INFO L158 Benchmark]: Witness Printer took 6.58ms. Allocated memory is still 167.8MB. Free memory was 47.1MB in the beginning and 47.1MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:21,093 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.24ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.31ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 110.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.34ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 108.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.88ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 245.23ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 91.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2581.77ms. Allocated memory is still 167.8MB. Free memory was 90.5MB in the beginning and 47.1MB in the end (delta: 43.4MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * Witness Printer took 6.58ms. Allocated memory is still 167.8MB. Free memory was 47.1MB in the beginning and 47.1MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 33, overapproximation of shiftRight at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] unsigned short int var_1_2 = 45931; [L24] unsigned short int var_1_3 = 30067; [L25] unsigned short int var_1_4 = 256; [L26] unsigned short int var_1_5 = 10000; [L27] unsigned short int var_1_6 = 5; [L28] signed long int var_1_7 = -5; [L62] isInitial = 1 [L63] FCALL initially() [L64] COND TRUE 1 [L65] FCALL updateLastVariables() [L66] CALL updateVariables() [L39] var_1_2 = __VERIFIER_nondet_ushort() [L40] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L40] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L41] CALL assume_abort_if_not(var_1_2 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L41] RET assume_abort_if_not(var_1_2 <= 65534) VAL [isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L42] var_1_3 = __VERIFIER_nondet_ushort() [L43] CALL assume_abort_if_not(var_1_3 >= 24575) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L43] RET assume_abort_if_not(var_1_3 >= 24575) VAL [isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L44] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L44] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L45] var_1_4 = __VERIFIER_nondet_ushort() [L46] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_5=10000, var_1_6=5, var_1_7=-5] [L46] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_5=10000, var_1_6=5, var_1_7=-5] [L47] CALL assume_abort_if_not(var_1_4 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=10000, var_1_6=5, var_1_7=-5] [L47] RET assume_abort_if_not(var_1_4 <= 8192) VAL [isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=10000, var_1_6=5, var_1_7=-5] [L48] var_1_5 = __VERIFIER_nondet_ushort() [L49] CALL assume_abort_if_not(var_1_5 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=5, var_1_7=-5] [L49] RET assume_abort_if_not(var_1_5 >= 8191) VAL [isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=5, var_1_7=-5] [L50] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=5, var_1_7=-5] [L50] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=5, var_1_7=-5] [L51] var_1_6 = __VERIFIER_nondet_ushort() [L52] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_7=-5] [L52] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_7=-5] [L53] CALL assume_abort_if_not(var_1_6 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L53] RET assume_abort_if_not(var_1_6 <= 8191) VAL [isInitial=1, var_1_1=2, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L66] RET updateVariables() [L67] CALL step() [L32] var_1_1 = (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))) VAL [isInitial=1, var_1_1=16384, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L33] EXPR (var_1_3 + var_1_6) >> var_1_1 VAL [isInitial=1, var_1_1=16384, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L33] signed long int stepLocal_0 = (var_1_3 + var_1_6) >> var_1_1; [L34] COND FALSE !(var_1_4 != stepLocal_0) VAL [isInitial=1, var_1_1=16384, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L67] RET step() [L68] CALL, EXPR property() [L58] EXPR (var_1_1 == ((unsigned short int) (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))))) && ((var_1_4 != ((var_1_3 + var_1_6) >> var_1_1)) ? (var_1_7 == ((signed long int) var_1_2)) : 1) VAL [isInitial=1, var_1_1=16384, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L58] EXPR (var_1_3 + var_1_6) >> var_1_1 VAL [isInitial=1, var_1_1=16384, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L58] EXPR (var_1_1 == ((unsigned short int) (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))))) && ((var_1_4 != ((var_1_3 + var_1_6) >> var_1_1)) ? (var_1_7 == ((signed long int) var_1_2)) : 1) VAL [isInitial=1, var_1_1=16384, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L58-L59] return (var_1_1 == ((unsigned short int) (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))))) && ((var_1_4 != ((var_1_3 + var_1_6) >> var_1_1)) ? (var_1_7 == ((signed long int) var_1_2)) : 1) ; [L68] RET, EXPR property() [L68] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=16384, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L19] reach_error() VAL [isInitial=1, var_1_1=16384, var_1_2=2147581951, var_1_3=-40961, var_1_4=8192, var_1_5=8191, var_1_6=8191, var_1_7=-5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 63 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 857 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 569 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 282 IncrementalHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 288 mSDtfsCounter, 282 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 157 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 1242/1260 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:25:21,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.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 daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:25:23,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:25:23,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:25:23,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:25:23,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:25:23,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:25:23,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:25:23,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:25:23,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:25:23,301 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:25:23,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:25:23,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:25:23,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:25:23,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:25:23,302 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:25:23,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:25:23,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:25:23,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:25:23,303 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:25:23,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:25:23,303 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:25:23,303 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:25:23,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:25:23,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:25:23,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:25:23,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:25:23,303 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 -> daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff [2025-03-17 04:25:23,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:25:23,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:25:23,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:25:23,631 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:25:23,631 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:25:23,634 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-94.i [2025-03-17 04:25:24,841 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fa8ba94/5e07aab1af6f498a99fdcb552ef17ddd/FLAG14a9e53a1 [2025-03-17 04:25:25,015 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:25:25,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i [2025-03-17 04:25:25,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fa8ba94/5e07aab1af6f498a99fdcb552ef17ddd/FLAG14a9e53a1 [2025-03-17 04:25:25,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fa8ba94/5e07aab1af6f498a99fdcb552ef17ddd [2025-03-17 04:25:25,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:25:25,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:25:25,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:25:25,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:25:25,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:25:25,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:25:25" (1/1) ... [2025-03-17 04:25:25,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5864150d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:25, skipping insertion in model container [2025-03-17 04:25:25,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:25:25" (1/1) ... [2025-03-17 04:25:25,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:25:25,519 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-94.i[915,928] [2025-03-17 04:25:25,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:25:25,564 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:25:25,573 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-94.i[915,928] [2025-03-17 04:25:25,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:25:25,602 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:25:25,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:25 WrapperNode [2025-03-17 04:25:25,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:25:25,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:25:25,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:25:25,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:25:25,610 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:25:25" (1/1) ... [2025-03-17 04:25:25,618 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:25:25" (1/1) ... [2025-03-17 04:25:25,634 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 67 [2025-03-17 04:25:25,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:25:25,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:25:25,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:25:25,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:25:25,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:25" (1/1) ... [2025-03-17 04:25:25,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:25" (1/1) ... [2025-03-17 04:25:25,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:25" (1/1) ... [2025-03-17 04:25:25,661 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:25:25,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:25" (1/1) ... [2025-03-17 04:25:25,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:25" (1/1) ... [2025-03-17 04:25:25,668 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:25" (1/1) ... [2025-03-17 04:25:25,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:25" (1/1) ... [2025-03-17 04:25:25,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:25" (1/1) ... [2025-03-17 04:25:25,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:25" (1/1) ... [2025-03-17 04:25:25,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:25:25,675 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:25:25,675 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:25:25,675 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:25:25,679 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:25" (1/1) ... [2025-03-17 04:25:25,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:25:25,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:25,706 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:25:25,711 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:25:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:25:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:25:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:25:25,727 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:25:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:25:25,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:25:25,773 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:25:25,774 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:25:25,878 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 04:25:25,878 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:25:25,885 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:25:25,885 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:25:25,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:25 BoogieIcfgContainer [2025-03-17 04:25:25,886 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:25:25,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:25:25,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:25:25,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:25:25,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:25:25" (1/3) ... [2025-03-17 04:25:25,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d93e416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:25:25, skipping insertion in model container [2025-03-17 04:25:25,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:25" (2/3) ... [2025-03-17 04:25:25,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d93e416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:25:25, skipping insertion in model container [2025-03-17 04:25:25,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:25" (3/3) ... [2025-03-17 04:25:25,897 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-94.i [2025-03-17 04:25:25,910 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:25:25,912 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-94.i that has 2 procedures, 29 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:25:25,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:25:25,967 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;@2fefce99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:25:25,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:25:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:25:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 04:25:25,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:25,978 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 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:25:25,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:25,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:25,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1220116209, now seen corresponding path program 1 times [2025-03-17 04:25:25,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:25:25,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [901136709] [2025-03-17 04:25:25,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:25,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:25,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:25,997 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:25:25,998 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:25:26,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 04:25:26,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 04:25:26,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:26,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:26,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:25:26,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 04:25:26,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:25:26,145 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:25:26,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901136709] [2025-03-17 04:25:26,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901136709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:26,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:26,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:25:26,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781226540] [2025-03-17 04:25:26,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:26,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:25:26,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:25:26,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:25:26,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:25:26,163 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:25:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:26,179 INFO L93 Difference]: Finished difference Result 55 states and 90 transitions. [2025-03-17 04:25:26,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:25:26,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 61 [2025-03-17 04:25:26,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:26,185 INFO L225 Difference]: With dead ends: 55 [2025-03-17 04:25:26,186 INFO L226 Difference]: Without dead ends: 27 [2025-03-17 04:25:26,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 60 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:25:26,191 INFO L435 NwaCegarLoop]: 37 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, 37 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:25:26,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:25:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-17 04:25:26,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-17 04:25:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:25:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2025-03-17 04:25:26,213 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 61 [2025-03-17 04:25:26,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:26,213 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-03-17 04:25:26,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:25:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2025-03-17 04:25:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 04:25:26,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:26,215 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 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:25:26,221 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:25:26,416 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 [2025-03-17 04:25:26,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:26,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1775462993, now seen corresponding path program 1 times [2025-03-17 04:25:26,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:25:26,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1053482059] [2025-03-17 04:25:26,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:26,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:26,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:26,420 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:25:26,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:25:26,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 04:25:26,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 04:25:26,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:26,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:26,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 04:25:26,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-17 04:25:26,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:25:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 04:25:26,899 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:25:26,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053482059] [2025-03-17 04:25:26,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053482059] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 04:25:26,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:25:26,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 04:25:26,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303067362] [2025-03-17 04:25:26,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:26,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:25:26,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:25:26,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:25:26,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:25:26,902 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:25:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:27,055 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2025-03-17 04:25:27,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:25:27,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 61 [2025-03-17 04:25:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:27,057 INFO L225 Difference]: With dead ends: 34 [2025-03-17 04:25:27,057 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 04:25:27,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:25:27,058 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 9 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:27,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 96 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:25:27,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 04:25:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-17 04:25:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:25:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2025-03-17 04:25:27,062 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 61 [2025-03-17 04:25:27,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:27,066 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-03-17 04:25:27,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:25:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2025-03-17 04:25:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 04:25:27,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:27,067 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 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:25:27,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 04:25:27,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:27,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:27,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:27,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1775492784, now seen corresponding path program 1 times [2025-03-17 04:25:27,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:25:27,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1351764571] [2025-03-17 04:25:27,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:27,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:27,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:27,270 INFO L229 MonitoredProcess]: Starting monitored process 4 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:25:27,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 04:25:27,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 04:25:27,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 04:25:27,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:27,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:27,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 04:25:27,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-17 04:25:27,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:25:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 04:25:27,629 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:25:27,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351764571] [2025-03-17 04:25:27,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351764571] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 04:25:27,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:25:27,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 04:25:27,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147233346] [2025-03-17 04:25:27,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:27,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:25:27,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:25:27,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:25:27,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:25:27,630 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:25:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:27,719 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2025-03-17 04:25:27,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:25:27,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 61 [2025-03-17 04:25:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:27,720 INFO L225 Difference]: With dead ends: 31 [2025-03-17 04:25:27,720 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 04:25:27,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:25:27,722 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:27,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 81 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:25:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 04:25:27,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 04:25:27,723 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:25:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 04:25:27,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2025-03-17 04:25:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:27,723 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 04:25:27,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:25:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 04:25:27,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 04:25:27,725 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:25:27,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 04:25:27,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:27,933 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 04:25:27,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 04:25:27,953 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:25:27,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:25:27 BoogieIcfgContainer [2025-03-17 04:25:27,961 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:25:27,964 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:25:27,964 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:25:27,964 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:25:27,965 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:25" (3/4) ... [2025-03-17 04:25:27,966 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 04:25:27,969 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 04:25:27,973 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 04:25:27,973 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 04:25:27,973 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 04:25:27,973 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 04:25:28,040 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 04:25:28,040 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 04:25:28,040 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:25:28,041 INFO L158 Benchmark]: Toolchain (without parser) took 2639.34ms. Allocated memory is still 83.9MB. Free memory was 59.9MB in the beginning and 34.6MB in the end (delta: 25.3MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2025-03-17 04:25:28,042 INFO L158 Benchmark]: CDTParser took 2.43ms. Allocated memory is still 83.9MB. Free memory was 61.9MB in the beginning and 61.9MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:28,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.04ms. Allocated memory is still 83.9MB. Free memory was 59.9MB in the beginning and 47.9MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:28,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.57ms. Allocated memory is still 83.9MB. Free memory was 47.9MB in the beginning and 46.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:28,042 INFO L158 Benchmark]: Boogie Preprocessor took 38.72ms. Allocated memory is still 83.9MB. Free memory was 46.6MB in the beginning and 45.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:28,042 INFO L158 Benchmark]: IcfgBuilder took 210.97ms. Allocated memory is still 83.9MB. Free memory was 45.0MB in the beginning and 32.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:28,043 INFO L158 Benchmark]: TraceAbstraction took 2072.36ms. Allocated memory is still 83.9MB. Free memory was 31.8MB in the beginning and 40.8MB in the end (delta: -9.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:28,043 INFO L158 Benchmark]: Witness Printer took 76.21ms. Allocated memory is still 83.9MB. Free memory was 40.8MB in the beginning and 34.6MB in the end (delta: 6.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:28,044 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.43ms. Allocated memory is still 83.9MB. Free memory was 61.9MB in the beginning and 61.9MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.04ms. Allocated memory is still 83.9MB. Free memory was 59.9MB in the beginning and 47.9MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.57ms. Allocated memory is still 83.9MB. Free memory was 47.9MB in the beginning and 46.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.72ms. Allocated memory is still 83.9MB. Free memory was 46.6MB in the beginning and 45.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 210.97ms. Allocated memory is still 83.9MB. Free memory was 45.0MB in the beginning and 32.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2072.36ms. Allocated memory is still 83.9MB. Free memory was 31.8MB in the beginning and 40.8MB in the end (delta: -9.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 76.21ms. Allocated memory is still 83.9MB. Free memory was 40.8MB in the beginning and 34.6MB in the end (delta: 6.2MB). 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 - 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, 29 locations, 51 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 106 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 284 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 555 SizeOfPredicates, 15 NumberOfNonLiveVariables, 317 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 870/900 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:25:28,059 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