./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 798a7b37 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-?-798a7b3-m [2025-03-03 23:09:06,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:09:06,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:09:06,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:09:06,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:09:06,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:09:06,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:09:06,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:09:06,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:09:06,931 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:09:06,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:09:06,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:09:06,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:09:06,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:09:06,931 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:09:06,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:09:06,932 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:09:06,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:09:06,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:09:06,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:09:06,933 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:09:06,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:09:06,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:09:06,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:09:06,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:09:06,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:09:06,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:09:06,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:09:06,933 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-03 23:09:07,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:09:07,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:09:07,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:09:07,170 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:09:07,170 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:09:07,171 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-03 23:09:08,351 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ba92a24/bc7eb6d8f748437aacde11acbb2f6ec2/FLAG75cf49f10 [2025-03-03 23:09:08,573 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:09:08,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.i [2025-03-03 23:09:08,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ba92a24/bc7eb6d8f748437aacde11acbb2f6ec2/FLAG75cf49f10 [2025-03-03 23:09:08,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ba92a24/bc7eb6d8f748437aacde11acbb2f6ec2 [2025-03-03 23:09:08,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:09:08,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:09:08,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:09:08,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:09:08,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:09:08,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:09:08" (1/1) ... [2025-03-03 23:09:08,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d41fce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:08, skipping insertion in model container [2025-03-03 23:09:08,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:09:08" (1/1) ... [2025-03-03 23:09:08,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:09:09,039 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-03 23:09:09,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:09:09,088 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:09:09,096 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-03 23:09:09,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:09:09,128 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:09:09,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:09 WrapperNode [2025-03-03 23:09:09,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:09:09,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:09:09,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:09:09,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:09:09,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:09" (1/1) ... [2025-03-03 23:09:09,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:09" (1/1) ... [2025-03-03 23:09:09,165 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-03 23:09:09,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:09:09,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:09:09,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:09:09,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:09:09,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:09" (1/1) ... [2025-03-03 23:09:09,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:09" (1/1) ... [2025-03-03 23:09:09,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:09" (1/1) ... [2025-03-03 23:09:09,192 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-03 23:09:09,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:09" (1/1) ... [2025-03-03 23:09:09,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:09" (1/1) ... [2025-03-03 23:09:09,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:09" (1/1) ... [2025-03-03 23:09:09,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:09" (1/1) ... [2025-03-03 23:09:09,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:09" (1/1) ... [2025-03-03 23:09:09,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:09" (1/1) ... [2025-03-03 23:09:09,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:09:09,208 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:09:09,208 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:09:09,208 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:09:09,209 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:09" (1/1) ... [2025-03-03 23:09:09,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:09:09,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:09:09,243 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-03 23:09:09,248 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-03 23:09:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:09:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:09:09,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:09:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:09:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:09:09,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:09:09,317 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:09:09,318 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:09:09,491 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 23:09:09,491 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:09:09,502 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:09:09,502 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:09:09,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:09 BoogieIcfgContainer [2025-03-03 23:09:09,502 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:09:09,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:09:09,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:09:09,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:09:09,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:09:08" (1/3) ... [2025-03-03 23:09:09,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcc2150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:09:09, skipping insertion in model container [2025-03-03 23:09:09,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:09" (2/3) ... [2025-03-03 23:09:09,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcc2150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:09:09, skipping insertion in model container [2025-03-03 23:09:09,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:09" (3/3) ... [2025-03-03 23:09:09,511 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-41.i [2025-03-03 23:09:09,521 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:09:09,523 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-41.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:09:09,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:09:09,575 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;@4bc18b09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:09:09,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:09:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 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-03 23:09:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 23:09:09,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:09,587 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, 1, 1, 1] [2025-03-03 23:09:09,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:09,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:09,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2143645408, now seen corresponding path program 1 times [2025-03-03 23:09:09,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:09:09,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625900730] [2025-03-03 23:09:09,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:09,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:09:09,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:09:09,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:09:09,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:09,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:09,798 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-03 23:09:09,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:09:09,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625900730] [2025-03-03 23:09:09,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625900730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:09:09,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759993259] [2025-03-03 23:09:09,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:09,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:09:09,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:09:09,803 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-03 23:09:09,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-03 23:09:09,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:09:09,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:09:09,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:09,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:09,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:09:09,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:09:09,952 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-03 23:09:09,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:09:09,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759993259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:09:09,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:09:09,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:09:09,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277313608] [2025-03-03 23:09:09,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:09:09,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:09:09,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:09:09,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:09:09,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:09:09,978 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-03 23:09:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:09:09,996 INFO L93 Difference]: Finished difference Result 96 states and 157 transitions. [2025-03-03 23:09:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:09:09,998 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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 103 [2025-03-03 23:09:09,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:09:10,002 INFO L225 Difference]: With dead ends: 96 [2025-03-03 23:09:10,002 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 23:09:10,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-03 23:09:10,006 INFO L435 NwaCegarLoop]: 68 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, 68 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-03 23:09:10,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:09:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 23:09:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 23:09:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-03 23:09:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2025-03-03 23:09:10,038 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 103 [2025-03-03 23:09:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:09:10,039 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2025-03-03 23:09:10,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-03 23:09:10,040 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2025-03-03 23:09:10,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 23:09:10,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:10,043 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, 1, 1, 1] [2025-03-03 23:09:10,049 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-03 23:09:10,243 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-03 23:09:10,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:10,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:10,245 INFO L85 PathProgramCache]: Analyzing trace with hash 556269280, now seen corresponding path program 1 times [2025-03-03 23:09:10,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:09:10,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968217518] [2025-03-03 23:09:10,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:10,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:09:10,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:09:10,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:09:10,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:10,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:11,813 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-03 23:09:11,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:09:11,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968217518] [2025-03-03 23:09:11,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968217518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:09:11,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:09:11,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:09:11,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683419634] [2025-03-03 23:09:11,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:09:11,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:09:11,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:09:11,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:09:11,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:09:11,815 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-03 23:09:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:09:12,178 INFO L93 Difference]: Finished difference Result 113 states and 148 transitions. [2025-03-03 23:09:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:09:12,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 103 [2025-03-03 23:09:12,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:09:12,180 INFO L225 Difference]: With dead ends: 113 [2025-03-03 23:09:12,180 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 23:09:12,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:09:12,181 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 73 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:09:12,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 453 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:09:12,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 23:09:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2025-03-03 23:09:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 64 states have internal predecessors, (74), 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-03 23:09:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2025-03-03 23:09:12,213 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 103 [2025-03-03 23:09:12,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:09:12,214 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2025-03-03 23:09:12,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-03 23:09:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2025-03-03 23:09:12,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 23:09:12,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:12,219 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, 1, 1, 1] [2025-03-03 23:09:12,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:09:12,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:12,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1995887681, now seen corresponding path program 1 times [2025-03-03 23:09:12,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:09:12,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761673114] [2025-03-03 23:09:12,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:12,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:09:12,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:09:12,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:09:12,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:12,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:13,186 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-03 23:09:13,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:09:13,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761673114] [2025-03-03 23:09:13,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761673114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:09:13,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:09:13,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:09:13,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909619484] [2025-03-03 23:09:13,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:09:13,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:09:13,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:09:13,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:09:13,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:09:13,189 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-03 23:09:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:09:13,380 INFO L93 Difference]: Finished difference Result 193 states and 261 transitions. [2025-03-03 23:09:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:09:13,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 103 [2025-03-03 23:09:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:09:13,382 INFO L225 Difference]: With dead ends: 193 [2025-03-03 23:09:13,382 INFO L226 Difference]: Without dead ends: 104 [2025-03-03 23:09:13,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:09:13,383 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 62 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:09:13,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 421 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:09:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-03 23:09:13,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 81. [2025-03-03 23:09:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 56 states have internal predecessors, (65), 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-03 23:09:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2025-03-03 23:09:13,409 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 103 [2025-03-03 23:09:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:09:13,410 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2025-03-03 23:09:13,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-03 23:09:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2025-03-03 23:09:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 23:09:13,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:13,413 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, 1, 1, 1] [2025-03-03 23:09:13,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:09:13,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:13,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:13,413 INFO L85 PathProgramCache]: Analyzing trace with hash 359755775, now seen corresponding path program 1 times [2025-03-03 23:09:13,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:09:13,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374514556] [2025-03-03 23:09:13,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:13,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:09:13,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:09:13,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:09:13,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:13,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:14,175 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-03 23:09:14,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:09:14,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374514556] [2025-03-03 23:09:14,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374514556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:09:14,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:09:14,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:09:14,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60160632] [2025-03-03 23:09:14,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:09:14,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:09:14,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:09:14,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:09:14,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:09:14,177 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-03 23:09:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:09:14,366 INFO L93 Difference]: Finished difference Result 110 states and 140 transitions. [2025-03-03 23:09:14,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:09:14,367 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 103 [2025-03-03 23:09:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:09:14,370 INFO L225 Difference]: With dead ends: 110 [2025-03-03 23:09:14,372 INFO L226 Difference]: Without dead ends: 108 [2025-03-03 23:09:14,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:09:14,373 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:09:14,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 312 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:09:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-03 23:09:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2025-03-03 23:09:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 63 states have internal predecessors, (74), 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-03 23:09:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 118 transitions. [2025-03-03 23:09:14,400 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 118 transitions. Word has length 103 [2025-03-03 23:09:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:09:14,401 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 118 transitions. [2025-03-03 23:09:14,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-03 23:09:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 118 transitions. [2025-03-03 23:09:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 23:09:14,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:14,406 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, 1, 1, 1] [2025-03-03 23:09:14,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:09:14,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:14,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:14,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2102566110, now seen corresponding path program 1 times [2025-03-03 23:09:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:09:14,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129059309] [2025-03-03 23:09:14,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:09:14,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:09:14,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:09:14,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:14,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:15,103 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-03 23:09:15,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:09:15,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129059309] [2025-03-03 23:09:15,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129059309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:09:15,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:09:15,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:09:15,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808685327] [2025-03-03 23:09:15,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:09:15,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:09:15,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:09:15,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:09:15,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:09:15,107 INFO L87 Difference]: Start difference. First operand 88 states and 118 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-03 23:09:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:09:15,321 INFO L93 Difference]: Finished difference Result 110 states and 140 transitions. [2025-03-03 23:09:15,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:09:15,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 103 [2025-03-03 23:09:15,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:09:15,323 INFO L225 Difference]: With dead ends: 110 [2025-03-03 23:09:15,323 INFO L226 Difference]: Without dead ends: 108 [2025-03-03 23:09:15,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:09:15,324 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 36 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:09:15,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 294 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:09:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-03 23:09:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 84. [2025-03-03 23:09:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 59 states have internal predecessors, (68), 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-03 23:09:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 112 transitions. [2025-03-03 23:09:15,345 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 112 transitions. Word has length 103 [2025-03-03 23:09:15,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:09:15,346 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 112 transitions. [2025-03-03 23:09:15,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-03 23:09:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2025-03-03 23:09:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 23:09:15,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:15,347 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, 1, 1, 1, 1] [2025-03-03 23:09:15,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:09:15,347 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:15,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:15,349 INFO L85 PathProgramCache]: Analyzing trace with hash 94092709, now seen corresponding path program 1 times [2025-03-03 23:09:15,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:09:15,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500196489] [2025-03-03 23:09:15,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:15,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:09:15,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 23:09:15,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 23:09:15,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:15,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:15,414 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-03 23:09:15,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:09:15,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500196489] [2025-03-03 23:09:15,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500196489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:09:15,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:09:15,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:09:15,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201760325] [2025-03-03 23:09:15,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:09:15,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:09:15,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:09:15,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:09:15,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:09:15,417 INFO L87 Difference]: Start difference. First operand 84 states and 112 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-03 23:09:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:09:15,437 INFO L93 Difference]: Finished difference Result 154 states and 207 transitions. [2025-03-03 23:09:15,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:09:15,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 104 [2025-03-03 23:09:15,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:09:15,438 INFO L225 Difference]: With dead ends: 154 [2025-03-03 23:09:15,438 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 23:09:15,438 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-03 23:09:15,439 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 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-03 23:09:15,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:09:15,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 23:09:15,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 23:09:15,439 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-03 23:09:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 23:09:15,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2025-03-03 23:09:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:09:15,440 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 23:09:15,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-03 23:09:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 23:09:15,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 23:09:15,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:09:15,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:09:15,449 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 23:09:15,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 23:09:15,756 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:09:15,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:09:15 BoogieIcfgContainer [2025-03-03 23:09:15,768 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:09:15,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:09:15,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:09:15,769 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:09:15,769 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:09" (3/4) ... [2025-03-03 23:09:15,771 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 23:09:15,776 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-03 23:09:15,781 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-03 23:09:15,781 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 23:09:15,782 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 23:09:15,782 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 23:09:15,849 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 23:09:15,851 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 23:09:15,851 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:09:15,852 INFO L158 Benchmark]: Toolchain (without parser) took 6928.08ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 112.9MB in the beginning and 212.5MB in the end (delta: -99.6MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2025-03-03 23:09:15,852 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:09:15,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.03ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 100.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:09:15,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.33ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.6MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:09:15,853 INFO L158 Benchmark]: Boogie Preprocessor took 40.07ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:09:15,854 INFO L158 Benchmark]: IcfgBuilder took 293.96ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 81.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:09:15,854 INFO L158 Benchmark]: TraceAbstraction took 6262.35ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 81.0MB in the beginning and 220.8MB in the end (delta: -139.9MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. [2025-03-03 23:09:15,854 INFO L158 Benchmark]: Witness Printer took 82.38ms. Allocated memory is still 251.7MB. Free memory was 220.8MB in the beginning and 212.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:09:15,856 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 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.03ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 100.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.33ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.6MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.07ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 293.96ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 81.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6262.35ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 81.0MB in the beginning and 220.8MB in the end (delta: -139.9MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. * Witness Printer took 82.38ms. Allocated memory is still 251.7MB. Free memory was 220.8MB in the beginning and 212.5MB 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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207 mSDsluCounter, 1663 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1232 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 438 IncrementalHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 431 mSDtfsCounter, 438 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 86 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 722 NumberOfCodeBlocks, 722 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 2029 SizeOfPredicates, 0 NumberOfNonLiveVariables, 234 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_8 == 0)) && ((var_1_8 != 0) || (var_1_9 == 0))) || (var_1_5 == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-03 23:09:15,873 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