./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.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_loopvsstraightlinecode_25-1loop_file-86.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 0b1bd1257190961b4c1941dc1e9dfbe09ed3b9534a64219badf358449b7e869c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:33:37,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:33:37,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:33:37,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:33:37,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:33:37,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:33:37,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:33:37,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:33:37,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:33:37,242 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:33:37,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:33:37,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:33:37,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:33:37,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:33:37,243 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:33:37,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:33:37,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:33:37,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:33:37,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:33:37,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:33:37,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:33:37,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:33:37,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:33:37,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:33:37,245 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:33:37,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:33:37,245 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:33:37,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:33:37,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:33:37,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:33:37,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:33:37,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:33:37,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:33:37,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:33:37,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:33:37,246 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:33:37,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:33:37,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:33:37,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:33:37,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:33:37,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:33:37,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:33:37,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:33:37,247 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 -> 0b1bd1257190961b4c1941dc1e9dfbe09ed3b9534a64219badf358449b7e869c [2025-03-17 03:33:37,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:33:37,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:33:37,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:33:37,538 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:33:37,538 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:33:37,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i [2025-03-17 03:33:38,760 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e1aa443/97fee5950dae471e92372b2d5dd81fe3/FLAG14c540be4 [2025-03-17 03:33:39,062 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:33:39,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i [2025-03-17 03:33:39,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e1aa443/97fee5950dae471e92372b2d5dd81fe3/FLAG14c540be4 [2025-03-17 03:33:39,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e1aa443/97fee5950dae471e92372b2d5dd81fe3 [2025-03-17 03:33:39,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:33:39,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:33:39,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:33:39,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:33:39,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:33:39,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:33:39" (1/1) ... [2025-03-17 03:33:39,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bc7117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39, skipping insertion in model container [2025-03-17 03:33:39,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:33:39" (1/1) ... [2025-03-17 03:33:39,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:33:39,491 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_loopvsstraightlinecode_25-1loop_file-86.i[915,928] [2025-03-17 03:33:39,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:33:39,553 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:33:39,561 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_loopvsstraightlinecode_25-1loop_file-86.i[915,928] [2025-03-17 03:33:39,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:33:39,592 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:33:39,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39 WrapperNode [2025-03-17 03:33:39,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:33:39,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:33:39,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:33:39,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:33:39,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39" (1/1) ... [2025-03-17 03:33:39,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39" (1/1) ... [2025-03-17 03:33:39,635 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-17 03:33:39,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:33:39,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:33:39,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:33:39,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:33:39,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39" (1/1) ... [2025-03-17 03:33:39,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39" (1/1) ... [2025-03-17 03:33:39,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39" (1/1) ... [2025-03-17 03:33:39,659 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 03:33:39,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39" (1/1) ... [2025-03-17 03:33:39,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39" (1/1) ... [2025-03-17 03:33:39,673 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39" (1/1) ... [2025-03-17 03:33:39,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39" (1/1) ... [2025-03-17 03:33:39,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39" (1/1) ... [2025-03-17 03:33:39,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39" (1/1) ... [2025-03-17 03:33:39,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:33:39,678 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:33:39,678 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:33:39,679 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:33:39,679 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39" (1/1) ... [2025-03-17 03:33:39,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:33:39,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:33:39,709 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 03:33:39,716 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 03:33:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:33:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:33:39,736 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:33:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:33:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:33:39,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:33:39,792 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:33:39,794 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:33:40,027 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 03:33:40,028 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:33:40,044 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:33:40,045 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:33:40,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:33:40 BoogieIcfgContainer [2025-03-17 03:33:40,045 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:33:40,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:33:40,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:33:40,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:33:40,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:33:39" (1/3) ... [2025-03-17 03:33:40,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e1591b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:33:40, skipping insertion in model container [2025-03-17 03:33:40,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:39" (2/3) ... [2025-03-17 03:33:40,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e1591b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:33:40, skipping insertion in model container [2025-03-17 03:33:40,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:33:40" (3/3) ... [2025-03-17 03:33:40,054 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-86.i [2025-03-17 03:33:40,065 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:33:40,067 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-86.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:33:40,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:33:40,121 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;@30f8c9e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:33:40,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:33:40,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 03:33:40,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 03:33:40,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:33:40,134 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:33:40,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:33:40,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:33:40,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1442791852, now seen corresponding path program 1 times [2025-03-17 03:33:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:33:40,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184547734] [2025-03-17 03:33:40,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:33:40,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:33:40,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 03:33:40,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 03:33:40,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:33:40,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:33:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 03:33:44,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:33:44,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184547734] [2025-03-17 03:33:44,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184547734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:33:44,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:33:44,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:33:44,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368170198] [2025-03-17 03:33:44,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:33:44,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:33:44,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:33:44,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:33:44,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:33:44,227 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 03:33:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:33:44,769 INFO L93 Difference]: Finished difference Result 137 states and 237 transitions. [2025-03-17 03:33:44,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:33:44,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2025-03-17 03:33:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:33:44,777 INFO L225 Difference]: With dead ends: 137 [2025-03-17 03:33:44,777 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 03:33:44,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:33:44,782 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:33:44,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 211 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:33:44,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 03:33:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2025-03-17 03:33:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 03:33:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 123 transitions. [2025-03-17 03:33:44,823 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 123 transitions. Word has length 104 [2025-03-17 03:33:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:33:44,824 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 123 transitions. [2025-03-17 03:33:44,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 03:33:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 123 transitions. [2025-03-17 03:33:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 03:33:44,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:33:44,826 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:33:44,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 03:33:44,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:33:44,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:33:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1471421003, now seen corresponding path program 1 times [2025-03-17 03:33:44,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:33:44,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393577147] [2025-03-17 03:33:44,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:33:44,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:33:44,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 03:33:44,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 03:33:44,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:33:44,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:33:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 03:33:45,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:33:45,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393577147] [2025-03-17 03:33:45,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393577147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:33:45,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:33:45,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:33:45,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108210849] [2025-03-17 03:33:45,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:33:45,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:33:45,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:33:45,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:33:45,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:33:45,355 INFO L87 Difference]: Start difference. First operand 82 states and 123 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 03:33:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:33:45,594 INFO L93 Difference]: Finished difference Result 296 states and 440 transitions. [2025-03-17 03:33:45,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:33:45,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 104 [2025-03-17 03:33:45,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:33:45,598 INFO L225 Difference]: With dead ends: 296 [2025-03-17 03:33:45,598 INFO L226 Difference]: Without dead ends: 215 [2025-03-17 03:33:45,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:33:45,600 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 92 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:33:45,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 146 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:33:45,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-17 03:33:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 209. [2025-03-17 03:33:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 116 states have (on average 1.1982758620689655) internal successors, (139), 120 states have internal predecessors, (139), 86 states have call successors, (86), 6 states have call predecessors, (86), 6 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 03:33:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 311 transitions. [2025-03-17 03:33:45,669 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 311 transitions. Word has length 104 [2025-03-17 03:33:45,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:33:45,670 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 311 transitions. [2025-03-17 03:33:45,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 03:33:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 311 transitions. [2025-03-17 03:33:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 03:33:45,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:33:45,673 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:33:45,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:33:45,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:33:45,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:33:45,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1471450794, now seen corresponding path program 1 times [2025-03-17 03:33:45,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:33:45,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649719060] [2025-03-17 03:33:45,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:33:45,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:33:45,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 03:33:45,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 03:33:45,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:33:45,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:33:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 03:33:47,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:33:47,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649719060] [2025-03-17 03:33:47,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649719060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:33:47,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:33:47,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:33:47,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676762710] [2025-03-17 03:33:47,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:33:47,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:33:47,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:33:47,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:33:47,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:33:47,974 INFO L87 Difference]: Start difference. First operand 209 states and 311 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 03:33:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:33:48,411 INFO L93 Difference]: Finished difference Result 214 states and 314 transitions. [2025-03-17 03:33:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:33:48,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2025-03-17 03:33:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:33:48,416 INFO L225 Difference]: With dead ends: 214 [2025-03-17 03:33:48,416 INFO L226 Difference]: Without dead ends: 212 [2025-03-17 03:33:48,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:33:48,417 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 17 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:33:48,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 217 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:33:48,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-17 03:33:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 203. [2025-03-17 03:33:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 110 states have (on average 1.190909090909091) internal successors, (131), 114 states have internal predecessors, (131), 86 states have call successors, (86), 6 states have call predecessors, (86), 6 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 03:33:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 303 transitions. [2025-03-17 03:33:48,455 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 303 transitions. Word has length 104 [2025-03-17 03:33:48,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:33:48,455 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 303 transitions. [2025-03-17 03:33:48,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 03:33:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 303 transitions. [2025-03-17 03:33:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 03:33:48,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:33:48,459 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:33:48,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:33:48,459 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:33:48,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:33:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash -364632820, now seen corresponding path program 1 times [2025-03-17 03:33:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:33:48,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101761477] [2025-03-17 03:33:48,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:33:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:33:48,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 03:33:48,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 03:33:48,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:33:48,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:33:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 03:33:49,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:33:49,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101761477] [2025-03-17 03:33:49,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101761477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:33:49,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:33:49,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:33:49,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353511801] [2025-03-17 03:33:49,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:33:49,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:33:49,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:33:49,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:33:49,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:33:49,931 INFO L87 Difference]: Start difference. First operand 203 states and 303 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 03:33:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:33:50,195 INFO L93 Difference]: Finished difference Result 206 states and 305 transitions. [2025-03-17 03:33:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:33:50,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2025-03-17 03:33:50,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:33:50,202 INFO L225 Difference]: With dead ends: 206 [2025-03-17 03:33:50,204 INFO L226 Difference]: Without dead ends: 204 [2025-03-17 03:33:50,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:33:50,205 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:33:50,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 298 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:33:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-17 03:33:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2025-03-17 03:33:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 110 states have (on average 1.1636363636363636) internal successors, (128), 114 states have internal predecessors, (128), 86 states have call successors, (86), 6 states have call predecessors, (86), 6 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 03:33:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 300 transitions. [2025-03-17 03:33:50,232 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 300 transitions. Word has length 104 [2025-03-17 03:33:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:33:50,232 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 300 transitions. [2025-03-17 03:33:50,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 03:33:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 300 transitions. [2025-03-17 03:33:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 03:33:50,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:33:50,233 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:33:50,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:33:50,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:33:50,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:33:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1868208570, now seen corresponding path program 1 times [2025-03-17 03:33:50,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:33:50,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181833039] [2025-03-17 03:33:50,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:33:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:33:50,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 03:33:50,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 03:33:50,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:33:50,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:33:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 03:33:50,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:33:50,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181833039] [2025-03-17 03:33:50,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181833039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:33:50,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:33:50,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:33:50,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956467474] [2025-03-17 03:33:50,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:33:50,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:33:50,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:33:50,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:33:50,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:33:50,489 INFO L87 Difference]: Start difference. First operand 203 states and 300 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 03:33:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:33:50,704 INFO L93 Difference]: Finished difference Result 316 states and 460 transitions. [2025-03-17 03:33:50,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:33:50,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2025-03-17 03:33:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:33:50,705 INFO L225 Difference]: With dead ends: 316 [2025-03-17 03:33:50,705 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 03:33:50,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:33:50,708 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 88 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:33:50,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 163 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:33:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 03:33:50,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 03:33:50,708 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 03:33:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 03:33:50,710 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2025-03-17 03:33:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:33:50,710 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 03:33:50,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 03:33:50,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 03:33:50,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 03:33:50,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:33:50,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:33:50,718 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 03:33:50,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 03:33:51,534 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:33:51,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:33:51 BoogieIcfgContainer [2025-03-17 03:33:51,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:33:51,563 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:33:51,563 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:33:51,564 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:33:51,564 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:33:40" (3/4) ... [2025-03-17 03:33:51,568 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 03:33:51,573 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 03:33:51,578 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 03:33:51,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 03:33:51,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 03:33:51,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 03:33:51,666 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 03:33:51,667 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 03:33:51,667 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:33:51,668 INFO L158 Benchmark]: Toolchain (without parser) took 12324.86ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 104.6MB in the beginning and 237.3MB in the end (delta: -132.7MB). Peak memory consumption was 145.3MB. Max. memory is 16.1GB. [2025-03-17 03:33:51,668 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:33:51,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.97ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 92.2MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:33:51,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.93ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 89.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:33:51,668 INFO L158 Benchmark]: Boogie Preprocessor took 41.95ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 84.8MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:33:51,669 INFO L158 Benchmark]: IcfgBuilder took 366.91ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 65.1MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 03:33:51,670 INFO L158 Benchmark]: TraceAbstraction took 11515.81ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 64.1MB in the beginning and 245.6MB in the end (delta: -181.5MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. [2025-03-17 03:33:51,671 INFO L158 Benchmark]: Witness Printer took 103.57ms. Allocated memory is still 419.4MB. Free memory was 245.6MB in the beginning and 237.3MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:33:51,672 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.34ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.97ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 92.2MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.93ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 89.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.95ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 84.8MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 366.91ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 65.1MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11515.81ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 64.1MB in the beginning and 245.6MB in the end (delta: -181.5MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. * Witness Printer took 103.57ms. Allocated memory is still 419.4MB. Free memory was 245.6MB in the beginning and 237.3MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. 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, 45 locations, 85 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 278 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 278 mSDsluCounter, 1035 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 737 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 597 IncrementalHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 298 mSDtfsCounter, 597 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=2, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 516 ConstructedInterpolants, 0 QuantifiedInterpolants, 3116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2720/2720 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 - InvariantResult [Line: 96]: Location Invariant Derived location invariant: ((((((4294967295 + var_1_13) % 4294967296) <= 4294967294) && ((((((var_1_18 == var_1_16) && (0 <= 0)) && (0 <= 0)) && ((((((var_1_7 == var_1_11) || (var_1_9 < ((((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10) + 1))) || (var_1_16 == 0)) && (((((0 < (var_1_3 + 1)) || (var_1_7 == var_1_11)) || (var_1_16 == 0)) || (0 < ((long long) var_1_8 + 1))) || (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) == 0))) && ((((var_1_7 == var_1_11) || (var_1_16 == 0)) || (((long long) var_1_9 + 1) == (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10))) || (((var_1_3 + 1) <= 0) && (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) != 0)))) || (((long long) var_1_9 + 1) < (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10)))) && (4 <= var_1_7)) || (((((((var_1_18 < var_1_16) || (var_1_18 == var_1_16)) && (var_1_13 <= ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) >= 0) ? (((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) : ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) + 4294967296)))) && (0 <= 0)) && (0 <= 0)) && ((((((var_1_7 == var_1_11) || (var_1_9 < ((((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10) + 1))) || (var_1_16 == 0)) && (((((0 < (var_1_3 + 1)) || (var_1_7 == var_1_11)) || (var_1_16 == 0)) || (0 < ((long long) var_1_8 + 1))) || (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) == 0))) && ((((var_1_7 == var_1_11) || (var_1_16 == 0)) || (((long long) var_1_9 + 1) == (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10))) || (((var_1_3 + 1) <= 0) && (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) != 0)))) || (((long long) var_1_9 + 1) < (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10)))) && (4 <= var_1_7)))) || ((((((0 < var_1_7) || (var_1_12 == 0)) || (0 < (((var_1_7 * 4294967295) + var_1_13) % 4294967296))) && (var_1_7 == var_1_1)) && (var_1_13 <= ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) >= 0) ? (((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) : ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) + 4294967296)))) && ((((((var_1_7 == var_1_11) || (var_1_9 < ((((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10) + 1))) || (var_1_16 == 0)) && (((((0 < (var_1_3 + 1)) || (var_1_7 == var_1_11)) || (var_1_16 == 0)) || (0 < ((long long) var_1_8 + 1))) || (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) == 0))) && ((((var_1_7 == var_1_11) || (var_1_16 == 0)) || (((long long) var_1_9 + 1) == (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10))) || (((var_1_3 + 1) <= 0) && (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) != 0)))) || (((long long) var_1_9 + 1) < (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10))))) || (((((((var_1_18 < var_1_16) || (var_1_18 == var_1_16)) && (var_1_7 == var_1_1)) && (var_1_18 == var_1_16)) && (((4294967295 + var_1_13) % 4294967296) <= 4294967294)) && (0 <= 0)) && ((((((var_1_7 == var_1_11) || (var_1_9 < ((((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10) + 1))) || (var_1_16 == 0)) && (((((0 < (var_1_3 + 1)) || (var_1_7 == var_1_11)) || (var_1_16 == 0)) || (0 < ((long long) var_1_8 + 1))) || (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) == 0))) && ((((var_1_7 == var_1_11) || (var_1_16 == 0)) || (((long long) var_1_9 + 1) == (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10))) || (((var_1_3 + 1) <= 0) && (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) != 0)))) || (((long long) var_1_9 + 1) < (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10))))) RESULT: Ultimate proved your program to be correct! [2025-03-17 03:33:51,731 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 Writing output log to file Ultimate.log Result: TRUE