./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c --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/nla-digbench-scaling/dijkstra-u_valuebound1.c -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 a2e0d3ed79ba62190a0b501c090bc81fd178363cb7e6ce8cbe0996ce655e2ac6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:45:45,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:45:45,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:45:45,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:45:45,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:45:45,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:45:45,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:45:45,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:45:45,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:45:45,920 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:45:45,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:45:45,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:45:45,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:45:45,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:45:45,922 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:45:45,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:45:45,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:45:45,922 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:45:45,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:45:45,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:45:45,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:45:45,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:45:45,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:45:45,923 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:45:45,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:45:45,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:45:45,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:45:45,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:45:45,924 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 -> a2e0d3ed79ba62190a0b501c090bc81fd178363cb7e6ce8cbe0996ce655e2ac6 [2025-03-03 13:45:46,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:45:46,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:45:46,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:45:46,172 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:45:46,173 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:45:46,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c [2025-03-03 13:45:47,358 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee87d60c6/fe425ab213ee4c4691a904db15647c28/FLAG25e1f2e46 [2025-03-03 13:45:47,575 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:45:47,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c [2025-03-03 13:45:47,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee87d60c6/fe425ab213ee4c4691a904db15647c28/FLAG25e1f2e46 [2025-03-03 13:45:47,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee87d60c6/fe425ab213ee4c4691a904db15647c28 [2025-03-03 13:45:47,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:45:47,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:45:47,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:45:47,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:45:47,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:45:47,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:45:47" (1/1) ... [2025-03-03 13:45:47,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5463abaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47, skipping insertion in model container [2025-03-03 13:45:47,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:45:47" (1/1) ... [2025-03-03 13:45:47,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:45:47,722 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/nla-digbench-scaling/dijkstra-u_valuebound1.c[525,538] [2025-03-03 13:45:47,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:45:47,760 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:45:47,768 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/nla-digbench-scaling/dijkstra-u_valuebound1.c[525,538] [2025-03-03 13:45:47,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:45:47,801 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:45:47,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47 WrapperNode [2025-03-03 13:45:47,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:45:47,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:45:47,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:45:47,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:45:47,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47" (1/1) ... [2025-03-03 13:45:47,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47" (1/1) ... [2025-03-03 13:45:47,828 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2025-03-03 13:45:47,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:45:47,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:45:47,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:45:47,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:45:47,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47" (1/1) ... [2025-03-03 13:45:47,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47" (1/1) ... [2025-03-03 13:45:47,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47" (1/1) ... [2025-03-03 13:45:47,852 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 13:45:47,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47" (1/1) ... [2025-03-03 13:45:47,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47" (1/1) ... [2025-03-03 13:45:47,856 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47" (1/1) ... [2025-03-03 13:45:47,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47" (1/1) ... [2025-03-03 13:45:47,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47" (1/1) ... [2025-03-03 13:45:47,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47" (1/1) ... [2025-03-03 13:45:47,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:45:47,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:45:47,868 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:45:47,868 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:45:47,869 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47" (1/1) ... [2025-03-03 13:45:47,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:45:47,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:45:47,895 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 13:45:47,900 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 13:45:47,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:45:47,913 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 13:45:47,913 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 13:45:47,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:45:47,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:45:47,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:45:47,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:45:47,914 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:45:47,953 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:45:47,955 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:45:48,127 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-03 13:45:48,127 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:45:48,135 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:45:48,136 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:45:48,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:45:48 BoogieIcfgContainer [2025-03-03 13:45:48,137 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:45:48,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:45:48,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:45:48,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:45:48,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:45:47" (1/3) ... [2025-03-03 13:45:48,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f643ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:45:48, skipping insertion in model container [2025-03-03 13:45:48,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:45:47" (2/3) ... [2025-03-03 13:45:48,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f643ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:45:48, skipping insertion in model container [2025-03-03 13:45:48,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:45:48" (3/3) ... [2025-03-03 13:45:48,145 INFO L128 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound1.c [2025-03-03 13:45:48,155 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:45:48,156 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dijkstra-u_valuebound1.c that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 13:45:48,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:45:48,201 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;@4619f3aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:45:48,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:45:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 13:45:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:45:48,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:45:48,212 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:45:48,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:45:48,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:45:48,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1503588837, now seen corresponding path program 1 times [2025-03-03 13:45:48,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:45:48,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425681851] [2025-03-03 13:45:48,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:45:48,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:45:48,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:45:48,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:45:48,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:45:48,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:45:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:45:48,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:45:48,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425681851] [2025-03-03 13:45:48,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425681851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:45:48,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732334162] [2025-03-03 13:45:48,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:45:48,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:45:48,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:45:48,328 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 13:45:48,330 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 13:45:48,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:45:48,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:45:48,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:45:48,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:45:48,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 13:45:48,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:45:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:45:48,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:45:48,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732334162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:45:48,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:45:48,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 13:45:48,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034535911] [2025-03-03 13:45:48,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:45:48,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:45:48,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:45:48,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:45:48,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:45:48,413 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:45:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:45:48,428 INFO L93 Difference]: Finished difference Result 59 states and 99 transitions. [2025-03-03 13:45:48,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:45:48,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-03-03 13:45:48,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:45:48,434 INFO L225 Difference]: With dead ends: 59 [2025-03-03 13:45:48,434 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 13:45:48,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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 13:45:48,441 INFO L435 NwaCegarLoop]: 42 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, 42 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 13:45:48,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:45:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 13:45:48,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-03 13:45:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 13:45:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2025-03-03 13:45:48,472 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 18 [2025-03-03 13:45:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:45:48,472 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2025-03-03 13:45:48,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:45:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2025-03-03 13:45:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:45:48,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:45:48,475 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:45:48,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 13:45:48,675 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 13:45:48,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:45:48,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:45:48,676 INFO L85 PathProgramCache]: Analyzing trace with hash -809424251, now seen corresponding path program 1 times [2025-03-03 13:45:48,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:45:48,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030891619] [2025-03-03 13:45:48,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:45:48,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:45:48,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:45:48,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:45:48,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:45:48,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:45:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:45:49,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:45:49,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030891619] [2025-03-03 13:45:49,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030891619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:45:49,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:45:49,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:45:49,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194839216] [2025-03-03 13:45:49,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:45:49,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:45:49,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:45:49,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:45:49,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:45:49,041 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:45:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:45:49,181 INFO L93 Difference]: Finished difference Result 56 states and 84 transitions. [2025-03-03 13:45:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:45:49,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-03 13:45:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:45:49,182 INFO L225 Difference]: With dead ends: 56 [2025-03-03 13:45:49,182 INFO L226 Difference]: Without dead ends: 39 [2025-03-03 13:45:49,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:45:49,183 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:45:49,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 149 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:45:49,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-03 13:45:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-03 13:45:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 13:45:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2025-03-03 13:45:49,197 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 18 [2025-03-03 13:45:49,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:45:49,197 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2025-03-03 13:45:49,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:45:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2025-03-03 13:45:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 13:45:49,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:45:49,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:45:49,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:45:49,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:45:49,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:45:49,199 INFO L85 PathProgramCache]: Analyzing trace with hash 702201767, now seen corresponding path program 1 times [2025-03-03 13:45:49,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:45:49,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779800184] [2025-03-03 13:45:49,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:45:49,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:45:49,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:45:49,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:45:49,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:45:49,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:45:49,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:45:49,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:45:49,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779800184] [2025-03-03 13:45:49,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779800184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:45:49,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976774889] [2025-03-03 13:45:49,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:45:49,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:45:49,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:45:49,485 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:45:49,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:45:49,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:45:49,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:45:49,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:45:49,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:45:49,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:45:49,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:45:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:45:49,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:45:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:45:49,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976774889] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:45:49,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:45:49,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-03 13:45:49,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020364005] [2025-03-03 13:45:49,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:45:49,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 13:45:49,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:45:49,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 13:45:49,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:45:49,753 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:45:54,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 13:45:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:45:54,932 INFO L93 Difference]: Finished difference Result 118 states and 201 transitions. [2025-03-03 13:45:54,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 13:45:54,934 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-03 13:45:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:45:54,935 INFO L225 Difference]: With dead ends: 118 [2025-03-03 13:45:54,935 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 13:45:54,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:45:54,938 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 16 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 143 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:45:54,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 223 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 212 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-03 13:45:54,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 13:45:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 57. [2025-03-03 13:45:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 13:45:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2025-03-03 13:45:54,954 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 19 [2025-03-03 13:45:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:45:54,954 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2025-03-03 13:45:54,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:45:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2025-03-03 13:45:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:45:54,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:45:54,955 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:45:54,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:45:55,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 13:45:55,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:45:55,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:45:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash 791975719, now seen corresponding path program 2 times [2025-03-03 13:45:55,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:45:55,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984774480] [2025-03-03 13:45:55,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:45:55,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:45:55,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-03 13:45:55,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 23 statements. [2025-03-03 13:45:55,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 13:45:55,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:45:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 13:45:55,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:45:55,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984774480] [2025-03-03 13:45:55,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984774480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:45:55,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:45:55,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:45:55,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975768143] [2025-03-03 13:45:55,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:45:55,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:45:55,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:45:55,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:45:55,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:45:55,276 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:45:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:45:55,637 INFO L93 Difference]: Finished difference Result 91 states and 140 transitions. [2025-03-03 13:45:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:45:55,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-03 13:45:55,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:45:55,638 INFO L225 Difference]: With dead ends: 91 [2025-03-03 13:45:55,639 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 13:45:55,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:45:55,639 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:45:55,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 128 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:45:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 13:45:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2025-03-03 13:45:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 13:45:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2025-03-03 13:45:55,650 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 23 [2025-03-03 13:45:55,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:45:55,650 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2025-03-03 13:45:55,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:45:55,650 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2025-03-03 13:45:55,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:45:55,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:45:55,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:45:55,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:45:55,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:45:55,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:45:55,651 INFO L85 PathProgramCache]: Analyzing trace with hash -497181440, now seen corresponding path program 1 times [2025-03-03 13:45:55,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:45:55,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670496797] [2025-03-03 13:45:55,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:45:55,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:45:55,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:45:55,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:45:55,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:45:55,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:45:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:45:55,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:45:55,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670496797] [2025-03-03 13:45:55,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670496797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:45:55,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355076841] [2025-03-03 13:45:55,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:45:55,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:45:55,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:45:55,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:45:55,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:45:55,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:45:55,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:45:55,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:45:55,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:45:55,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:45:55,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:45:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:45:55,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:45:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:45:55,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355076841] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:45:55,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:45:55,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 14 [2025-03-03 13:45:55,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933180365] [2025-03-03 13:45:55,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:45:55,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:45:55,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:45:55,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:45:55,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:45:55,938 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 13:46:01,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:46:05,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 13:46:06,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 13:46:10,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 13:46:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:46:10,539 INFO L93 Difference]: Finished difference Result 94 states and 134 transitions. [2025-03-03 13:46:10,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:46:10,540 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2025-03-03 13:46:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:46:10,540 INFO L225 Difference]: With dead ends: 94 [2025-03-03 13:46:10,540 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 13:46:10,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:46:10,542 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 18 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 56 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2025-03-03 13:46:10,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 282 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 147 Invalid, 3 Unknown, 0 Unchecked, 14.6s Time] [2025-03-03 13:46:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 13:46:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2025-03-03 13:46:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 24 states have (on average 1.125) internal successors, (27), 27 states have internal predecessors, (27), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 13:46:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2025-03-03 13:46:10,555 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 25 [2025-03-03 13:46:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:46:10,555 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2025-03-03 13:46:10,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 13:46:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2025-03-03 13:46:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 13:46:10,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:46:10,557 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:46:10,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:46:10,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:46:10,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:46:10,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:46:10,758 INFO L85 PathProgramCache]: Analyzing trace with hash 252907429, now seen corresponding path program 1 times [2025-03-03 13:46:10,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:46:10,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715829325] [2025-03-03 13:46:10,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:46:10,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:46:10,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 13:46:10,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:46:10,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:46:10,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:46:10,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561117942] [2025-03-03 13:46:10,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:46:10,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:46:10,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:46:10,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:46:10,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:46:10,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 13:46:10,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:46:10,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:46:10,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:46:10,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:46:10,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:46:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:46:10,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:46:10,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:46:10,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715829325] [2025-03-03 13:46:10,848 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:46:10,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561117942] [2025-03-03 13:46:10,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561117942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:46:10,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:46:10,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:46:10,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189741685] [2025-03-03 13:46:10,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:46:10,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:46:10,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:46:10,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:46:10,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:46:10,849 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 13:46:14,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:46:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:46:14,944 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2025-03-03 13:46:14,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:46:14,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-03-03 13:46:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:46:14,945 INFO L225 Difference]: With dead ends: 73 [2025-03-03 13:46:14,945 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 13:46:14,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:46:14,946 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:46:14,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 123 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 13:46:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 13:46:14,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 13:46:14,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 31 states have (on average 1.096774193548387) internal successors, (34), 34 states have internal predecessors, (34), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 13:46:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2025-03-03 13:46:14,959 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 28 [2025-03-03 13:46:14,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:46:14,959 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2025-03-03 13:46:14,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 13:46:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2025-03-03 13:46:14,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 13:46:14,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:46:14,961 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 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 13:46:14,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 13:46:15,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:46:15,161 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:46:15,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:46:15,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1634073514, now seen corresponding path program 1 times [2025-03-03 13:46:15,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:46:15,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033420995] [2025-03-03 13:46:15,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:46:15,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:46:15,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 13:46:15,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 13:46:15,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:46:15,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:46:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-03 13:46:16,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:46:16,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033420995] [2025-03-03 13:46:16,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033420995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:46:16,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151474411] [2025-03-03 13:46:16,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:46:16,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:46:16,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:46:16,076 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:46:16,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:46:16,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 13:46:16,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 13:46:16,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:46:16,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:46:16,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 13:46:16,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:46:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 13:46:16,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:46:29,454 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 13:46:54,201 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 13:47:03,982 WARN L286 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 13:47:28,619 WARN L286 SmtUtils]: Spent 16.11s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)