./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.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-41.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 7566a205875353a7a53577ca4c9ca94a9d2d53458c01e4aa6bab26ab44feec5a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:28:02,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:28:02,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:28:02,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:28:02,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:28:02,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:28:02,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:28:02,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:28:02,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:28:02,154 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:28:02,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:28:02,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:28:02,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:28:02,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:28:02,155 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:28:02,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:28:02,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:28:02,156 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:28:02,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:28:02,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:28:02,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:28:02,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:28:02,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:28:02,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:28:02,157 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:28:02,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:28:02,157 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:28:02,157 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:28:02,157 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:28:02,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:28:02,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:28:02,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:28:02,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:28:02,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:28:02,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:28:02,158 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:28:02,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:28:02,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:28:02,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:28:02,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:28:02,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:28:02,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:28:02,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:28:02,159 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 -> 7566a205875353a7a53577ca4c9ca94a9d2d53458c01e4aa6bab26ab44feec5a [2025-03-17 03:28:02,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:28:02,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:28:02,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:28:02,410 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:28:02,410 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:28:02,412 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-41.i [2025-03-17 03:28:03,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba45bdb12/2078b24e26934125b2328cf19e04d398/FLAG820c8fcbd [2025-03-17 03:28:03,844 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:28:03,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.i [2025-03-17 03:28:03,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba45bdb12/2078b24e26934125b2328cf19e04d398/FLAG820c8fcbd [2025-03-17 03:28:03,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba45bdb12/2078b24e26934125b2328cf19e04d398 [2025-03-17 03:28:03,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:28:03,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:28:03,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:28:03,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:28:03,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:28:03,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:28:03" (1/1) ... [2025-03-17 03:28:03,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8a9f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:28:03, skipping insertion in model container [2025-03-17 03:28:03,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:28:03" (1/1) ... [2025-03-17 03:28:03,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:28:04,006 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-41.i[915,928] [2025-03-17 03:28:04,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:28:04,060 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:28:04,069 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-41.i[915,928] [2025-03-17 03:28:04,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:28:04,102 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:28:04,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:28:04 WrapperNode [2025-03-17 03:28:04,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:28:04,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:28:04,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:28:04,105 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:28:04,109 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:28:04" (1/1) ... [2025-03-17 03:28:04,115 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:28:04" (1/1) ... [2025-03-17 03:28:04,136 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-17 03:28:04,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:28:04,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:28:04,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:28:04,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:28:04,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:28:04" (1/1) ... [2025-03-17 03:28:04,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:28:04" (1/1) ... [2025-03-17 03:28:04,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:28:04" (1/1) ... [2025-03-17 03:28:04,166 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:28:04,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:28:04" (1/1) ... [2025-03-17 03:28:04,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:28:04" (1/1) ... [2025-03-17 03:28:04,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:28:04" (1/1) ... [2025-03-17 03:28:04,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:28:04" (1/1) ... [2025-03-17 03:28:04,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:28:04" (1/1) ... [2025-03-17 03:28:04,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:28:04" (1/1) ... [2025-03-17 03:28:04,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:28:04,182 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:28:04,182 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:28:04,182 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:28:04,183 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:28:04" (1/1) ... [2025-03-17 03:28:04,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:28:04,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:28:04,211 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:28:04,216 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:28:04,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:28:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:28:04,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:28:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:28:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:28:04,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:28:04,283 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:28:04,285 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:28:04,484 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 03:28:04,484 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:28:04,491 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:28:04,492 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:28:04,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:28:04 BoogieIcfgContainer [2025-03-17 03:28:04,492 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:28:04,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:28:04,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:28:04,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:28:04,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:28:03" (1/3) ... [2025-03-17 03:28:04,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598aa599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:28:04, skipping insertion in model container [2025-03-17 03:28:04,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:28:04" (2/3) ... [2025-03-17 03:28:04,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598aa599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:28:04, skipping insertion in model container [2025-03-17 03:28:04,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:28:04" (3/3) ... [2025-03-17 03:28:04,500 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-41.i [2025-03-17 03:28:04,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:28:04,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-41.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:28:04,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:28:04,567 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;@7d83eded, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:28:04,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:28:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:28:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 03:28:04,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:28:04,578 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:04,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:28:04,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:28:04,583 INFO L85 PathProgramCache]: Analyzing trace with hash 908552981, now seen corresponding path program 1 times [2025-03-17 03:28:04,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:28:04,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951959336] [2025-03-17 03:28:04,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:28:04,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:28:04,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:28:04,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:28:04,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:28:04,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:28:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:28:04,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:28:04,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951959336] [2025-03-17 03:28:04,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951959336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:28:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850558655] [2025-03-17 03:28:04,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:28:04,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:28:04,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:28:04,806 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 03:28:04,808 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 03:28:04,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:28:04,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:28:04,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:28:04,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:28:04,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:28:04,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:28:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:28:04,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:28:04,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850558655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:28:04,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:28:04,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:28:04,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351729371] [2025-03-17 03:28:04,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:28:04,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:28:04,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:28:04,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:28:04,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:28:04,971 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:28:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:28:04,989 INFO L93 Difference]: Finished difference Result 88 states and 149 transitions. [2025-03-17 03:28:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:28:04,990 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 99 [2025-03-17 03:28:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:28:04,994 INFO L225 Difference]: With dead ends: 88 [2025-03-17 03:28:04,994 INFO L226 Difference]: Without dead ends: 42 [2025-03-17 03:28:04,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 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 03:28:04,998 INFO L435 NwaCegarLoop]: 63 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, 63 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 03:28:04,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:28:05,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-17 03:28:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-17 03:28:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:28:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2025-03-17 03:28:05,034 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 99 [2025-03-17 03:28:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:28:05,035 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2025-03-17 03:28:05,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:28:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2025-03-17 03:28:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 03:28:05,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:28:05,040 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:05,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:28:05,245 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 03:28:05,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:28:05,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:28:05,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1775052011, now seen corresponding path program 1 times [2025-03-17 03:28:05,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:28:05,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280490112] [2025-03-17 03:28:05,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:28:05,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:28:05,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:28:05,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:28:05,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:28:05,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:28:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:28:06,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:28:06,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280490112] [2025-03-17 03:28:06,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280490112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:28:06,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:28:06,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:28:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438222293] [2025-03-17 03:28:06,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:28:06,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:28:06,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:28:06,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:28:06,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:28:06,693 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:28:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:28:06,948 INFO L93 Difference]: Finished difference Result 103 states and 138 transitions. [2025-03-17 03:28:06,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:28:06,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2025-03-17 03:28:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:28:06,951 INFO L225 Difference]: With dead ends: 103 [2025-03-17 03:28:06,951 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 03:28:06,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:28:06,952 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 76 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:28:06,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 306 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:28:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 03:28:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2025-03-17 03:28:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 55 states have internal predecessors, (65), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 03:28:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2025-03-17 03:28:06,978 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 99 [2025-03-17 03:28:06,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:28:06,979 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2025-03-17 03:28:06,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:28:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2025-03-17 03:28:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 03:28:06,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:28:06,983 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:06,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:28:06,984 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:28:06,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:28:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash -887548330, now seen corresponding path program 1 times [2025-03-17 03:28:06,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:28:06,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979051453] [2025-03-17 03:28:06,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:28:06,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:28:07,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:28:07,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:28:07,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:28:07,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:28:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:28:07,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:28:07,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979051453] [2025-03-17 03:28:07,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979051453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:28:07,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:28:07,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:28:07,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247545556] [2025-03-17 03:28:07,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:28:07,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:28:07,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:28:07,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:28:07,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:28:07,959 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:28:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:28:08,167 INFO L93 Difference]: Finished difference Result 109 states and 143 transitions. [2025-03-17 03:28:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:28:08,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2025-03-17 03:28:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:28:08,170 INFO L225 Difference]: With dead ends: 109 [2025-03-17 03:28:08,170 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 03:28:08,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:28:08,170 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 75 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:28:08,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 284 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:28:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 03:28:08,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 70. [2025-03-17 03:28:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 03:28:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2025-03-17 03:28:08,190 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 99 [2025-03-17 03:28:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:28:08,190 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2025-03-17 03:28:08,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:28:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2025-03-17 03:28:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 03:28:08,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:28:08,192 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:08,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:28:08,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:28:08,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:28:08,193 INFO L85 PathProgramCache]: Analyzing trace with hash 712460822, now seen corresponding path program 1 times [2025-03-17 03:28:08,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:28:08,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921276194] [2025-03-17 03:28:08,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:28:08,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:28:08,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:28:08,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:28:08,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:28:08,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:28:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:28:08,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:28:08,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921276194] [2025-03-17 03:28:08,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921276194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:28:08,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:28:08,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:28:08,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264036758] [2025-03-17 03:28:08,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:28:08,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:28:08,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:28:08,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:28:08,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:28:08,883 INFO L87 Difference]: Start difference. First operand 70 states and 97 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:28:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:28:09,043 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2025-03-17 03:28:09,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:28:09,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2025-03-17 03:28:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:28:09,045 INFO L225 Difference]: With dead ends: 98 [2025-03-17 03:28:09,045 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 03:28:09,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:28:09,046 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 22 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:28:09,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 269 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:28:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 03:28:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2025-03-17 03:28:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.22) internal successors, (61), 51 states have internal predecessors, (61), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 03:28:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 105 transitions. [2025-03-17 03:28:09,058 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 105 transitions. Word has length 99 [2025-03-17 03:28:09,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:28:09,058 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 105 transitions. [2025-03-17 03:28:09,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:28:09,058 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 105 transitions. [2025-03-17 03:28:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 03:28:09,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:28:09,059 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:09,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:28:09,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:28:09,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:28:09,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1599964503, now seen corresponding path program 1 times [2025-03-17 03:28:09,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:28:09,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737636912] [2025-03-17 03:28:09,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:28:09,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:28:09,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:28:09,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:28:09,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:28:09,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:28:09,555 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:28:09,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:28:09,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737636912] [2025-03-17 03:28:09,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737636912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:28:09,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:28:09,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:28:09,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466541083] [2025-03-17 03:28:09,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:28:09,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:28:09,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:28:09,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:28:09,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:28:09,557 INFO L87 Difference]: Start difference. First operand 76 states and 105 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:28:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:28:09,643 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2025-03-17 03:28:09,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:28:09,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2025-03-17 03:28:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:28:09,644 INFO L225 Difference]: With dead ends: 90 [2025-03-17 03:28:09,645 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 03:28:09,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:28:09,645 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 26 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:28:09,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 233 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:28:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 03:28:09,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2025-03-17 03:28:09,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 03:28:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2025-03-17 03:28:09,658 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 99 [2025-03-17 03:28:09,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:28:09,659 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2025-03-17 03:28:09,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:28:09,660 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2025-03-17 03:28:09,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 03:28:09,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:28:09,663 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:09,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:28:09,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:28:09,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:28:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash 808917775, now seen corresponding path program 1 times [2025-03-17 03:28:09,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:28:09,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130864078] [2025-03-17 03:28:09,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:28:09,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:28:09,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 03:28:09,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 03:28:09,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:28:09,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:28:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:28:09,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:28:09,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130864078] [2025-03-17 03:28:09,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130864078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:28:09,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:28:09,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:28:09,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564202647] [2025-03-17 03:28:09,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:28:09,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:28:09,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:28:09,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:28:09,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:28:09,735 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:28:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:28:09,753 INFO L93 Difference]: Finished difference Result 135 states and 186 transitions. [2025-03-17 03:28:09,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:28:09,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2025-03-17 03:28:09,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:28:09,755 INFO L225 Difference]: With dead ends: 135 [2025-03-17 03:28:09,755 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 03:28:09,756 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 03:28:09,758 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:28:09,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:28:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 03:28:09,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 03:28:09,761 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:28:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 03:28:09,761 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2025-03-17 03:28:09,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:28:09,761 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 03:28:09,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:28:09,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 03:28:09,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 03:28:09,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:28:09,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:28:09,766 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 03:28:09,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 03:28:10,039 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:28:10,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:28:10 BoogieIcfgContainer [2025-03-17 03:28:10,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:28:10,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:28:10,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:28:10,054 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:28:10,054 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:28:04" (3/4) ... [2025-03-17 03:28:10,056 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 03:28:10,060 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 03:28:10,064 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 03:28:10,064 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 03:28:10,065 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 03:28:10,065 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 03:28:10,133 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 03:28:10,133 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 03:28:10,134 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:28:10,135 INFO L158 Benchmark]: Toolchain (without parser) took 6258.58ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 124.5MB in the beginning and 151.1MB in the end (delta: -26.6MB). Peak memory consumption was 186.1MB. Max. memory is 16.1GB. [2025-03-17 03:28:10,135 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:28:10,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.36ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 111.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:28:10,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.12ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 109.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:28:10,136 INFO L158 Benchmark]: Boogie Preprocessor took 40.13ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.9MB in the end (delta: 899.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:28:10,137 INFO L158 Benchmark]: IcfgBuilder took 310.58ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 93.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:28:10,137 INFO L158 Benchmark]: TraceAbstraction took 5557.04ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 93.0MB in the beginning and 159.5MB in the end (delta: -66.5MB). Peak memory consumption was 144.2MB. Max. memory is 16.1GB. [2025-03-17 03:28:10,137 INFO L158 Benchmark]: Witness Printer took 80.28ms. Allocated memory is still 385.9MB. Free memory was 159.5MB in the beginning and 151.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:28:10,138 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.21ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.36ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 111.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.12ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 109.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.13ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.9MB in the end (delta: 899.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 310.58ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 93.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5557.04ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 93.0MB in the beginning and 159.5MB in the end (delta: -66.5MB). Peak memory consumption was 144.2MB. Max. memory is 16.1GB. * Witness Printer took 80.28ms. Allocated memory is still 385.9MB. Free memory was 159.5MB in the beginning and 151.1MB in the end (delta: 8.4MB). 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, 84 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 1262 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 842 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 361 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 420 mSDtfsCounter, 361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=2, InterpolantAutomatonStates: 33, 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, 91 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 694 NumberOfCodeBlocks, 694 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 687 ConstructedInterpolants, 0 QuantifiedInterpolants, 1923 SizeOfPredicates, 0 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 3330/3360 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: 98]: Location Invariant Derived location invariant: ((((((var_1_8 == 1) && (var_1_9 != 0)) || ((var_1_9 == 0) && (var_1_8 == 0))) && ((((2 + var_1_7) == 0) && (var_1_9 == 0)) || (var_1_10 == (((((unsigned long long) 4294967295 * var_1_13) + var_1_12) + var_1_11) % 4294967296)))) && (((var_1_10 == ((((unsigned long long) 4294967295 * var_1_13) + var_1_14) % 4294967296)) || ((2 + var_1_7) != 0)) || (var_1_9 != 0))) || (var_1_5 == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-17 03:28:10,156 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