./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.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 26517bdd67184dea6352cf50b6d9992d41ecfd853675bfc685354b90b7b5bf40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:04:01,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:04:01,401 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:04:01,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:04:01,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:04:01,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:04:01,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:04:01,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:04:01,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:04:01,426 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:04:01,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:04:01,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:04:01,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:04:01,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:04:01,426 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:04:01,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:04:01,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:04:01,427 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:04:01,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:04:01,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:04:01,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:04:01,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:04:01,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:04:01,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:04:01,428 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:04:01,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:04:01,428 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:04:01,428 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:04:01,428 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:04:01,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:04:01,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:04:01,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:04:01,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:04:01,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:04:01,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:04:01,429 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:04:01,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:04:01,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:04:01,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:04:01,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:04:01,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:04:01,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:04:01,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:04:01,429 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 -> 26517bdd67184dea6352cf50b6d9992d41ecfd853675bfc685354b90b7b5bf40 [2025-03-16 18:04:01,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:04:01,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:04:01,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:04:01,648 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:04:01,648 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:04:01,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2025-03-16 18:04:02,966 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeeea69b9/514adbe7b272472197bdf13645f42e51/FLAG6698bf292 [2025-03-16 18:04:03,156 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:04:03,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2025-03-16 18:04:03,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeeea69b9/514adbe7b272472197bdf13645f42e51/FLAG6698bf292 [2025-03-16 18:04:03,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeeea69b9/514adbe7b272472197bdf13645f42e51 [2025-03-16 18:04:03,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:04:03,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:04:03,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:04:03,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:04:03,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:04:03,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:04:03" (1/1) ... [2025-03-16 18:04:03,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e0f2d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03, skipping insertion in model container [2025-03-16 18:04:03,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:04:03" (1/1) ... [2025-03-16 18:04:03,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:04:03,793 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_unwindbound10.c[525,538] [2025-03-16 18:04:03,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:04:03,841 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:04:03,853 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_unwindbound10.c[525,538] [2025-03-16 18:04:03,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:04:03,911 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:04:03,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03 WrapperNode [2025-03-16 18:04:03,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:04:03,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:04:03,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:04:03,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:04:03,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03" (1/1) ... [2025-03-16 18:04:03,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03" (1/1) ... [2025-03-16 18:04:03,959 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-03-16 18:04:03,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:04:03,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:04:03,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:04:03,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:04:03,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03" (1/1) ... [2025-03-16 18:04:03,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03" (1/1) ... [2025-03-16 18:04:03,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03" (1/1) ... [2025-03-16 18:04:03,981 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-16 18:04:03,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03" (1/1) ... [2025-03-16 18:04:03,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03" (1/1) ... [2025-03-16 18:04:03,987 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03" (1/1) ... [2025-03-16 18:04:03,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03" (1/1) ... [2025-03-16 18:04:03,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03" (1/1) ... [2025-03-16 18:04:03,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03" (1/1) ... [2025-03-16 18:04:03,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:04:04,000 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:04:04,000 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:04:04,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:04:04,001 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03" (1/1) ... [2025-03-16 18:04:04,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:04:04,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:04:04,039 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-16 18:04:04,044 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-16 18:04:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:04:04,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:04:04,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:04:04,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:04:04,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-16 18:04:04,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-16 18:04:04,160 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:04:04,162 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:04:04,488 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-16 18:04:04,490 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:04:04,508 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:04:04,508 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:04:04,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:04:04 BoogieIcfgContainer [2025-03-16 18:04:04,509 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:04:04,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:04:04,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:04:04,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:04:04,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:04:03" (1/3) ... [2025-03-16 18:04:04,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2a0e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:04:04, skipping insertion in model container [2025-03-16 18:04:04,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:04:03" (2/3) ... [2025-03-16 18:04:04,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2a0e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:04:04, skipping insertion in model container [2025-03-16 18:04:04,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:04:04" (3/3) ... [2025-03-16 18:04:04,523 INFO L128 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound10.c [2025-03-16 18:04:04,549 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:04:04,550 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dijkstra-u_unwindbound10.c that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 18:04:04,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:04:04,659 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;@2bd6cec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:04:04,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:04:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-16 18:04:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 18:04:04,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:04:04,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:04:04,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:04:04,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:04:04,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1518983890, now seen corresponding path program 1 times [2025-03-16 18:04:04,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:04:04,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731489570] [2025-03-16 18:04:04,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:04:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:04:04,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 18:04:04,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 18:04:04,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:04:04,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:04:04,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:04:04,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731489570] [2025-03-16 18:04:04,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731489570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:04:04,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:04:04,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 18:04:04,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017426082] [2025-03-16 18:04:04,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:04:04,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 18:04:04,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:04:04,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 18:04:04,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 18:04:04,906 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:04:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:04:04,924 INFO L93 Difference]: Finished difference Result 54 states and 94 transitions. [2025-03-16 18:04:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 18:04:04,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 18:04:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:04:04,929 INFO L225 Difference]: With dead ends: 54 [2025-03-16 18:04:04,929 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 18:04:04,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-16 18:04:04,936 INFO L435 NwaCegarLoop]: 40 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, 40 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-16 18:04:04,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:04:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 18:04:04,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-16 18:04:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-16 18:04:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2025-03-16 18:04:04,971 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 9 [2025-03-16 18:04:04,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:04:04,972 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2025-03-16 18:04:04,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:04:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2025-03-16 18:04:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 18:04:04,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:04:04,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:04:04,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:04:04,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:04:04,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:04:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1098429594, now seen corresponding path program 1 times [2025-03-16 18:04:04,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:04:04,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181690305] [2025-03-16 18:04:04,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:04:04,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:04:04,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 18:04:04,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 18:04:04,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:04:04,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:04:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:05,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:04:05,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181690305] [2025-03-16 18:04:05,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181690305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:04:05,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:04:05,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:04:05,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788569434] [2025-03-16 18:04:05,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:04:05,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:04:05,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:04:05,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:04:05,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:04:05,123 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:04:05,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:04:05,161 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2025-03-16 18:04:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:04:05,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-16 18:04:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:04:05,168 INFO L225 Difference]: With dead ends: 46 [2025-03-16 18:04:05,168 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 18:04:05,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:04:05,168 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:04:05,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:04:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 18:04:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 18:04:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-16 18:04:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2025-03-16 18:04:05,185 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 11 [2025-03-16 18:04:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:04:05,185 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2025-03-16 18:04:05,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:04:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2025-03-16 18:04:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 18:04:05,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:04:05,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:04:05,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:04:05,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:04:05,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:04:05,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1249900870, now seen corresponding path program 1 times [2025-03-16 18:04:05,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:04:05,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715211393] [2025-03-16 18:04:05,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:04:05,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:04:05,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 18:04:05,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 18:04:05,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:04:05,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:04:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:04:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715211393] [2025-03-16 18:04:05,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715211393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:04:05,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:04:05,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:04:05,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430833352] [2025-03-16 18:04:05,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:04:05,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:04:05,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:04:05,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:04:05,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:04:05,894 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:04:07,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:04:07,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:04:07,322 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2025-03-16 18:04:07,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:04:07,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-16 18:04:07,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:04:07,325 INFO L225 Difference]: With dead ends: 63 [2025-03-16 18:04:07,325 INFO L226 Difference]: Without dead ends: 44 [2025-03-16 18:04:07,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-16 18:04:07,326 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:04:07,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 138 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 18:04:07,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-16 18:04:07,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2025-03-16 18:04:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-16 18:04:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2025-03-16 18:04:07,358 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 12 [2025-03-16 18:04:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:04:07,358 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2025-03-16 18:04:07,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:04:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2025-03-16 18:04:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 18:04:07,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:04:07,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:04:07,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:04:07,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:04:07,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:04:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1250466899, now seen corresponding path program 1 times [2025-03-16 18:04:07,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:04:07,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401146739] [2025-03-16 18:04:07,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:04:07,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:04:07,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 18:04:07,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 18:04:07,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:04:07,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:04:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:07,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:04:07,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401146739] [2025-03-16 18:04:07,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401146739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:04:07,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:04:07,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:04:07,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911501104] [2025-03-16 18:04:07,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:04:07,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:04:07,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:04:07,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:04:07,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:04:07,500 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:04:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:04:07,580 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2025-03-16 18:04:07,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:04:07,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-16 18:04:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:04:07,585 INFO L225 Difference]: With dead ends: 51 [2025-03-16 18:04:07,585 INFO L226 Difference]: Without dead ends: 42 [2025-03-16 18:04:07,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:04:07,589 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:04:07,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 128 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:04:07,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-16 18:04:07,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-03-16 18:04:07,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-16 18:04:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2025-03-16 18:04:07,618 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 12 [2025-03-16 18:04:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:04:07,618 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-03-16 18:04:07,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:04:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2025-03-16 18:04:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 18:04:07,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:04:07,618 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:04:07,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:04:07,619 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:04:07,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:04:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1378941817, now seen corresponding path program 1 times [2025-03-16 18:04:07,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:04:07,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184453690] [2025-03-16 18:04:07,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:04:07,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:04:07,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 18:04:07,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 18:04:07,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:04:07,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:04:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:07,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:04:07,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184453690] [2025-03-16 18:04:07,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184453690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:04:07,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128468763] [2025-03-16 18:04:07,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:04:07,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:04:07,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:04:07,715 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-16 18:04:07,720 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-16 18:04:07,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 18:04:07,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 18:04:07,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:04:07,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:04:07,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 18:04:07,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:04:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:07,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:04:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:07,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128468763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:04:07,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:04:07,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-16 18:04:07,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391337396] [2025-03-16 18:04:07,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:04:07,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:04:07,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:04:07,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:04:07,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:04:07,940 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:04:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:04:08,395 INFO L93 Difference]: Finished difference Result 97 states and 141 transitions. [2025-03-16 18:04:08,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:04:08,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-16 18:04:08,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:04:08,399 INFO L225 Difference]: With dead ends: 97 [2025-03-16 18:04:08,399 INFO L226 Difference]: Without dead ends: 78 [2025-03-16 18:04:08,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:04:08,400 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 58 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 18:04:08,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 175 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 18:04:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-16 18:04:08,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2025-03-16 18:04:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 36 states have internal predecessors, (44), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-16 18:04:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2025-03-16 18:04:08,426 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 14 [2025-03-16 18:04:08,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:04:08,430 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2025-03-16 18:04:08,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:04:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2025-03-16 18:04:08,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 18:04:08,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:04:08,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:04:08,443 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-16 18:04:08,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:04:08,632 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:04:08,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:04:08,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1143956549, now seen corresponding path program 1 times [2025-03-16 18:04:08,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:04:08,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812068374] [2025-03-16 18:04:08,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:04:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:04:08,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 18:04:08,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 18:04:08,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:04:08,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:04:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:09,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:04:09,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812068374] [2025-03-16 18:04:09,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812068374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:04:09,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885472540] [2025-03-16 18:04:09,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:04:09,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:04:09,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:04:09,087 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-16 18:04:09,088 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-16 18:04:09,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 18:04:09,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 18:04:09,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:04:09,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:04:09,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 18:04:09,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:04:09,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:09,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:04:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:09,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885472540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:04:09,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:04:09,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-16 18:04:09,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556008646] [2025-03-16 18:04:09,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:04:09,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 18:04:09,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:04:09,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 18:04:09,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-16 18:04:09,818 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:04:13,949 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-16 18:04:18,062 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-16 18:04:19,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:04:19,112 INFO L93 Difference]: Finished difference Result 145 states and 229 transitions. [2025-03-16 18:04:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 18:04:19,112 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-16 18:04:19,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:04:19,114 INFO L225 Difference]: With dead ends: 145 [2025-03-16 18:04:19,115 INFO L226 Difference]: Without dead ends: 122 [2025-03-16 18:04:19,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 18:04:19,116 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 57 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 156 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:04:19,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 239 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 175 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2025-03-16 18:04:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-16 18:04:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 87. [2025-03-16 18:04:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 53 states have internal predecessors, (63), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 18:04:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2025-03-16 18:04:19,134 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 15 [2025-03-16 18:04:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:04:19,134 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2025-03-16 18:04:19,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:04:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2025-03-16 18:04:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 18:04:19,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:04:19,135 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:04:19,140 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-16 18:04:19,339 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,SelfDestructingSolverStorable5 [2025-03-16 18:04:19,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:04:19,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:04:19,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1144522578, now seen corresponding path program 1 times [2025-03-16 18:04:19,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:04:19,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533532226] [2025-03-16 18:04:19,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:04:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:04:19,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 18:04:19,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 18:04:19,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:04:19,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:04:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:19,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:04:19,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533532226] [2025-03-16 18:04:19,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533532226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:04:19,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901433083] [2025-03-16 18:04:19,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:04:19,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:04:19,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:04:19,392 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-16 18:04:19,394 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-16 18:04:19,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 18:04:19,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 18:04:19,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:04:19,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:04:19,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 18:04:19,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:04:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:19,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:04:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:19,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901433083] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:04:19,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:04:19,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-16 18:04:19,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81662446] [2025-03-16 18:04:19,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:04:19,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 18:04:19,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:04:19,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 18:04:19,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:04:19,496 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:04:20,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 18:04:24,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:04:28,964 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-16 18:04:33,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:04:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:04:33,028 INFO L93 Difference]: Finished difference Result 169 states and 231 transitions. [2025-03-16 18:04:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 18:04:33,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-16 18:04:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:04:33,059 INFO L225 Difference]: With dead ends: 169 [2025-03-16 18:04:33,059 INFO L226 Difference]: Without dead ends: 159 [2025-03-16 18:04:33,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:04:33,060 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 139 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 70 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2025-03-16 18:04:33,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 197 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 91 Invalid, 3 Unknown, 0 Unchecked, 13.5s Time] [2025-03-16 18:04:33,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-16 18:04:33,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2025-03-16 18:04:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 94 states have internal predecessors, (109), 51 states have call successors, (51), 11 states have call predecessors, (51), 11 states have return successors, (47), 44 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-16 18:04:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 207 transitions. [2025-03-16 18:04:33,108 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 207 transitions. Word has length 15 [2025-03-16 18:04:33,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:04:33,108 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 207 transitions. [2025-03-16 18:04:33,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:04:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 207 transitions. [2025-03-16 18:04:33,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 18:04:33,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:04:33,115 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:04:33,125 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-16 18:04:33,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:04:33,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:04:33,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:04:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash -713396090, now seen corresponding path program 1 times [2025-03-16 18:04:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:04:33,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698729896] [2025-03-16 18:04:33,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:04:33,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:04:33,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 18:04:33,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 18:04:33,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:04:33,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:04:33,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1908366300] [2025-03-16 18:04:33,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:04:33,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:04:33,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:04:33,376 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-16 18:04:33,381 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-16 18:04:33,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 18:04:33,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 18:04:33,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:04:33,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:04:33,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 18:04:33,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:04:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:04:33,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:04:33,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:04:33,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698729896] [2025-03-16 18:04:33,531 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:04:33,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908366300] [2025-03-16 18:04:33,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908366300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:04:33,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:04:33,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:04:33,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181560630] [2025-03-16 18:04:33,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:04:33,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:04:33,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:04:33,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:04:33,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:04:33,532 INFO L87 Difference]: Start difference. First operand 150 states and 207 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 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-16 18:04:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:04:33,713 INFO L93 Difference]: Finished difference Result 208 states and 288 transitions. [2025-03-16 18:04:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:04:33,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 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 22 [2025-03-16 18:04:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:04:33,716 INFO L225 Difference]: With dead ends: 208 [2025-03-16 18:04:33,719 INFO L226 Difference]: Without dead ends: 200 [2025-03-16 18:04:33,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-16 18:04:33,720 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:04:33,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:04:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-16 18:04:33,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-16 18:04:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 111 states have (on average 1.2162162162162162) internal successors, (135), 118 states have internal predecessors, (135), 72 states have call successors, (72), 17 states have call predecessors, (72), 16 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-16 18:04:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 272 transitions. [2025-03-16 18:04:33,774 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 272 transitions. Word has length 22 [2025-03-16 18:04:33,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:04:33,775 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 272 transitions. [2025-03-16 18:04:33,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 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-16 18:04:33,775 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 272 transitions. [2025-03-16 18:04:33,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 18:04:33,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:04:33,775 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:04:33,791 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-16 18:04:33,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:04:33,983 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:04:33,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:04:33,983 INFO L85 PathProgramCache]: Analyzing trace with hash 994370494, now seen corresponding path program 1 times [2025-03-16 18:04:33,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:04:33,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356312161] [2025-03-16 18:04:33,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:04:33,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:04:33,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 18:04:34,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 18:04:34,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:04:34,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:04:34,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986029820] [2025-03-16 18:04:34,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:04:34,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:04:34,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:04:34,028 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-16 18:04:34,030 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-16 18:04:34,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 18:04:34,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 18:04:34,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:04:34,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:04:34,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 18:04:34,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:04:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:34,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:04:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:04:37,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:04:37,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356312161] [2025-03-16 18:04:37,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:04:37,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986029820] [2025-03-16 18:04:37,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986029820] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:04:37,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:04:37,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-03-16 18:04:37,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983680931] [2025-03-16 18:04:37,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:04:37,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 18:04:37,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:04:37,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 18:04:37,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:04:37,335 INFO L87 Difference]: Start difference. First operand 200 states and 272 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 18:04:47,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:04:52,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:04:54,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:04:59,357 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-16 18:05:03,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:05:07,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:05:11,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:05:16,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.83s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:05:21,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:05:25,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:05:29,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:05:33,432 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-16 18:05:36,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:05:40,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:05:44,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:05:46,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:05:50,230 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-16 18:05:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:05:50,262 INFO L93 Difference]: Finished difference Result 286 states and 387 transitions. [2025-03-16 18:05:50,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:05:50,264 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-03-16 18:05:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:05:50,269 INFO L225 Difference]: With dead ends: 286 [2025-03-16 18:05:50,269 INFO L226 Difference]: Without dead ends: 250 [2025-03-16 18:05:50,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2025-03-16 18:05:50,269 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 65 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.9s IncrementalHoareTripleChecker+Time [2025-03-16 18:05:50,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 323 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 192 Invalid, 14 Unknown, 0 Unchecked, 66.9s Time] [2025-03-16 18:05:50,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-16 18:05:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 242. [2025-03-16 18:05:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 137 states have (on average 1.1824817518248176) internal successors, (162), 143 states have internal predecessors, (162), 82 states have call successors, (82), 23 states have call predecessors, (82), 22 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-16 18:05:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 320 transitions. [2025-03-16 18:05:50,361 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 320 transitions. Word has length 23 [2025-03-16 18:05:50,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:05:50,361 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 320 transitions. [2025-03-16 18:05:50,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 18:05:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 320 transitions. [2025-03-16 18:05:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 18:05:50,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:05:50,362 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:05:50,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 18:05:50,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:05:50,563 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:05:50,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:05:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash 715539494, now seen corresponding path program 2 times [2025-03-16 18:05:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:05:50,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260734396] [2025-03-16 18:05:50,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:05:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:05:50,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-16 18:05:50,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 23 statements. [2025-03-16 18:05:50,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 18:05:50,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:05:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 18:05:50,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:05:50,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260734396] [2025-03-16 18:05:50,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260734396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:05:50,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:05:50,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:05:50,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165543889] [2025-03-16 18:05:50,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:05:50,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:05:50,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:05:50,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:05:50,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:05:50,651 INFO L87 Difference]: Start difference. First operand 242 states and 320 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:05:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:05:50,796 INFO L93 Difference]: Finished difference Result 289 states and 381 transitions. [2025-03-16 18:05:50,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:05:50,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-16 18:05:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:05:50,802 INFO L225 Difference]: With dead ends: 289 [2025-03-16 18:05:50,802 INFO L226 Difference]: Without dead ends: 249 [2025-03-16 18:05:50,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-16 18:05:50,803 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:05:50,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:05:50,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-16 18:05:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 244. [2025-03-16 18:05:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 138 states have (on average 1.1666666666666667) internal successors, (161), 144 states have internal predecessors, (161), 82 states have call successors, (82), 24 states have call predecessors, (82), 23 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-16 18:05:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 319 transitions. [2025-03-16 18:05:50,861 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 319 transitions. Word has length 23 [2025-03-16 18:05:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:05:50,865 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 319 transitions. [2025-03-16 18:05:50,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:05:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 319 transitions. [2025-03-16 18:05:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 18:05:50,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:05:50,869 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:05:50,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 18:05:50,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:05:50,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:05:50,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2120677360, now seen corresponding path program 1 times [2025-03-16 18:05:50,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:05:50,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511647715] [2025-03-16 18:05:50,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:05:50,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:05:50,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 18:05:50,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 18:05:50,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:05:50,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:05:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:05:51,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:05:51,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511647715] [2025-03-16 18:05:51,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511647715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:05:51,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260103491] [2025-03-16 18:05:51,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:05:51,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:05:51,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:05:51,098 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:05:51,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 18:05:51,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 18:05:51,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 18:05:51,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:05:51,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:05:51,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 18:05:51,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:05:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 18:05:51,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:05:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:05:51,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260103491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:05:51,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:05:51,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-03-16 18:05:51,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259303007] [2025-03-16 18:05:51,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:05:51,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 18:05:51,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:05:51,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 18:05:51,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:05:51,418 INFO L87 Difference]: Start difference. First operand 244 states and 319 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)