./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:01:41,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:01:41,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:01:41,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:01:41,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:01:41,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:01:41,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:01:41,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:01:41,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:01:41,893 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:01:41,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:01:41,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:01:41,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:01:41,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:01:41,895 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:01:41,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:01:41,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:01:41,895 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:01:41,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:01:41,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:01:41,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:01:41,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:01:41,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:01:41,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:01:41,895 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:01:41,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:01:41,895 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:01:41,895 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:01:41,895 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:01:41,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:01:41,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:01:41,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:01:41,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:01:41,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:01:41,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:01:41,896 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:01:41,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:01:41,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:01:41,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:01:41,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:01:41,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:01:41,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:01:41,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:01:41,896 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 -> 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 [2025-03-16 14:01:42,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:01:42,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:01:42,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:01:42,110 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:01:42,110 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:01:42,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-1.i [2025-03-16 14:01:43,181 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2856a2bb/0a9b494eb6744feaa56bc80a8da1d8e7/FLAGc7bdb6197 [2025-03-16 14:01:43,420 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:01:43,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i [2025-03-16 14:01:43,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2856a2bb/0a9b494eb6744feaa56bc80a8da1d8e7/FLAGc7bdb6197 [2025-03-16 14:01:43,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2856a2bb/0a9b494eb6744feaa56bc80a8da1d8e7 [2025-03-16 14:01:43,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:01:43,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:01:43,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:01:43,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:01:43,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:01:43,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:01:43" (1/1) ... [2025-03-16 14:01:43,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@385bc50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43, skipping insertion in model container [2025-03-16 14:01:43,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:01:43" (1/1) ... [2025-03-16 14:01:43,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:01:43,864 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/bitvector/byte_add-1.i[1166,1179] [2025-03-16 14:01:43,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:01:43,910 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:01:43,918 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/bitvector/byte_add-1.i[1166,1179] [2025-03-16 14:01:43,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:01:43,960 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:01:43,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43 WrapperNode [2025-03-16 14:01:43,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:01:43,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:01:43,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:01:43,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:01:43,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43" (1/1) ... [2025-03-16 14:01:43,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43" (1/1) ... [2025-03-16 14:01:43,996 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 143 [2025-03-16 14:01:43,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:01:43,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:01:43,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:01:43,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:01:44,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43" (1/1) ... [2025-03-16 14:01:44,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43" (1/1) ... [2025-03-16 14:01:44,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43" (1/1) ... [2025-03-16 14:01:44,022 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 14:01:44,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43" (1/1) ... [2025-03-16 14:01:44,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43" (1/1) ... [2025-03-16 14:01:44,026 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43" (1/1) ... [2025-03-16 14:01:44,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43" (1/1) ... [2025-03-16 14:01:44,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43" (1/1) ... [2025-03-16 14:01:44,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43" (1/1) ... [2025-03-16 14:01:44,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:01:44,034 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:01:44,034 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:01:44,036 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:01:44,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43" (1/1) ... [2025-03-16 14:01:44,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:01:44,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:01:44,066 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 14:01:44,070 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 14:01:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:01:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:01:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:01:44,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:01:44,129 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:01:44,131 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:01:44,392 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-16 14:01:44,392 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:01:44,407 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:01:44,409 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:01:44,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:01:44 BoogieIcfgContainer [2025-03-16 14:01:44,409 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:01:44,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:01:44,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:01:44,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:01:44,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:01:43" (1/3) ... [2025-03-16 14:01:44,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@970c073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:01:44, skipping insertion in model container [2025-03-16 14:01:44,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:01:43" (2/3) ... [2025-03-16 14:01:44,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@970c073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:01:44, skipping insertion in model container [2025-03-16 14:01:44,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:01:44" (3/3) ... [2025-03-16 14:01:44,418 INFO L128 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2025-03-16 14:01:44,429 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:01:44,430 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG byte_add-1.i that has 1 procedures, 48 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 14:01:44,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:01:44,480 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;@5444cd0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:01:44,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:01:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 47 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:44,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 14:01:44,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:44,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:44,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:44,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:44,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1420198052, now seen corresponding path program 1 times [2025-03-16 14:01:44,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:44,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814303228] [2025-03-16 14:01:44,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:44,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:44,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 14:01:44,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 14:01:44,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:44,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:44,762 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 14:01:44,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:44,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814303228] [2025-03-16 14:01:44,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814303228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:44,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:01:44,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:01:44,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238771512] [2025-03-16 14:01:44,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:44,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:01:44,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:44,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:01:44,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:01:44,784 INFO L87 Difference]: Start difference. First operand has 48 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 47 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:44,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:44,935 INFO L93 Difference]: Finished difference Result 110 states and 191 transitions. [2025-03-16 14:01:44,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:01:44,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-16 14:01:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:44,941 INFO L225 Difference]: With dead ends: 110 [2025-03-16 14:01:44,941 INFO L226 Difference]: Without dead ends: 68 [2025-03-16 14:01:44,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:01:44,945 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 24 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:44,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 84 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:01:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-16 14:01:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2025-03-16 14:01:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 65 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2025-03-16 14:01:44,972 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 13 [2025-03-16 14:01:44,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:44,974 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2025-03-16 14:01:44,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2025-03-16 14:01:44,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 14:01:44,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:44,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:44,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:01:44,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:44,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:44,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1780316158, now seen corresponding path program 1 times [2025-03-16 14:01:44,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:44,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348238214] [2025-03-16 14:01:44,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:44,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:44,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 14:01:44,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 14:01:44,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:44,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:01:45,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:45,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348238214] [2025-03-16 14:01:45,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348238214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:45,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:01:45,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:01:45,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125909187] [2025-03-16 14:01:45,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:45,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:01:45,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:45,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:01:45,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:01:45,102 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:45,297 INFO L93 Difference]: Finished difference Result 161 states and 276 transitions. [2025-03-16 14:01:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:01:45,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 14:01:45,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:45,298 INFO L225 Difference]: With dead ends: 161 [2025-03-16 14:01:45,298 INFO L226 Difference]: Without dead ends: 125 [2025-03-16 14:01:45,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:01:45,299 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 92 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:45,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 101 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:01:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-16 14:01:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2025-03-16 14:01:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.5568181818181819) internal successors, (137), 88 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:45,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2025-03-16 14:01:45,308 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 19 [2025-03-16 14:01:45,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:45,308 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2025-03-16 14:01:45,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2025-03-16 14:01:45,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 14:01:45,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:45,309 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:45,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:01:45,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:45,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:45,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1482887482, now seen corresponding path program 1 times [2025-03-16 14:01:45,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:45,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754309175] [2025-03-16 14:01:45,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:45,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:45,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 14:01:45,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 14:01:45,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:45,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 14:01:45,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:45,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754309175] [2025-03-16 14:01:45,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754309175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:45,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:01:45,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:01:45,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200313177] [2025-03-16 14:01:45,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:45,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:01:45,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:45,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:01:45,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:01:45,464 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:45,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:45,585 INFO L93 Difference]: Finished difference Result 235 states and 358 transitions. [2025-03-16 14:01:45,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:01:45,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-16 14:01:45,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:45,587 INFO L225 Difference]: With dead ends: 235 [2025-03-16 14:01:45,587 INFO L226 Difference]: Without dead ends: 158 [2025-03-16 14:01:45,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:01:45,588 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 75 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:45,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 173 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:01:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-16 14:01:45,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 96. [2025-03-16 14:01:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 95 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2025-03-16 14:01:45,597 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 147 transitions. Word has length 25 [2025-03-16 14:01:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:45,598 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 147 transitions. [2025-03-16 14:01:45,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 147 transitions. [2025-03-16 14:01:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 14:01:45,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:45,599 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:45,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:01:45,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:45,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:45,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1984795798, now seen corresponding path program 1 times [2025-03-16 14:01:45,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:45,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984585226] [2025-03-16 14:01:45,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:45,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:45,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 14:01:45,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 14:01:45,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:45,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 14:01:45,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:45,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984585226] [2025-03-16 14:01:45,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984585226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:45,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:01:45,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:01:45,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038127937] [2025-03-16 14:01:45,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:45,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:01:45,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:45,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:01:45,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:01:45,740 INFO L87 Difference]: Start difference. First operand 96 states and 147 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:45,856 INFO L93 Difference]: Finished difference Result 241 states and 364 transitions. [2025-03-16 14:01:45,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:01:45,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-16 14:01:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:45,857 INFO L225 Difference]: With dead ends: 241 [2025-03-16 14:01:45,857 INFO L226 Difference]: Without dead ends: 164 [2025-03-16 14:01:45,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:01:45,859 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 70 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:45,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 165 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:01:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-16 14:01:45,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 107. [2025-03-16 14:01:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.5) internal successors, (159), 106 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2025-03-16 14:01:45,867 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 26 [2025-03-16 14:01:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:45,867 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2025-03-16 14:01:45,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2025-03-16 14:01:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 14:01:45,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:45,867 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:45,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:01:45,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:45,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1886196363, now seen corresponding path program 1 times [2025-03-16 14:01:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:45,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699600781] [2025-03-16 14:01:45,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:45,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:45,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 14:01:45,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 14:01:45,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:45,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:01:45,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:45,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699600781] [2025-03-16 14:01:45,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699600781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:01:45,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61836915] [2025-03-16 14:01:45,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:45,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:01:45,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:01:45,959 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 14:01:45,961 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 14:01:45,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 14:01:46,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 14:01:46,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:46,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:46,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 14:01:46,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:01:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 14:01:46,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:01:46,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61836915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:46,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:01:46,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-03-16 14:01:46,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689944297] [2025-03-16 14:01:46,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:46,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:01:46,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:46,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:01:46,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:01:46,057 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:46,212 INFO L93 Difference]: Finished difference Result 227 states and 360 transitions. [2025-03-16 14:01:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:01:46,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-16 14:01:46,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:46,213 INFO L225 Difference]: With dead ends: 227 [2025-03-16 14:01:46,213 INFO L226 Difference]: Without dead ends: 152 [2025-03-16 14:01:46,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:01:46,213 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:46,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 136 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:01:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-16 14:01:46,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2025-03-16 14:01:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4370370370370371) internal successors, (194), 135 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2025-03-16 14:01:46,219 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 27 [2025-03-16 14:01:46,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:46,220 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2025-03-16 14:01:46,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2025-03-16 14:01:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 14:01:46,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:46,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:46,228 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 14:01:46,425 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 14:01:46,425 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:46,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:46,426 INFO L85 PathProgramCache]: Analyzing trace with hash -26677199, now seen corresponding path program 1 times [2025-03-16 14:01:46,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:46,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610274409] [2025-03-16 14:01:46,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:46,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:46,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 14:01:46,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 14:01:46,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:46,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:01:46,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:46,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610274409] [2025-03-16 14:01:46,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610274409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:01:46,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069362370] [2025-03-16 14:01:46,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:46,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:01:46,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:01:46,559 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 14:01:46,560 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 14:01:46,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 14:01:46,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 14:01:46,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:46,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:46,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 14:01:46,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:01:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 14:01:46,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:01:46,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069362370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:46,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:01:46,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-16 14:01:46,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720093375] [2025-03-16 14:01:46,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:46,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:01:46,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:46,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:01:46,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:01:46,638 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:46,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:46,772 INFO L93 Difference]: Finished difference Result 285 states and 424 transitions. [2025-03-16 14:01:46,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:01:46,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 14:01:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:46,773 INFO L225 Difference]: With dead ends: 285 [2025-03-16 14:01:46,773 INFO L226 Difference]: Without dead ends: 181 [2025-03-16 14:01:46,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:01:46,774 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:46,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:01:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-16 14:01:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 159. [2025-03-16 14:01:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.3987341772151898) internal successors, (221), 158 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2025-03-16 14:01:46,780 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 33 [2025-03-16 14:01:46,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:46,780 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2025-03-16 14:01:46,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2025-03-16 14:01:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 14:01:46,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:46,781 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:46,787 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 14:01:46,981 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 14:01:46,982 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:46,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1385855861, now seen corresponding path program 1 times [2025-03-16 14:01:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:46,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890785590] [2025-03-16 14:01:46,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:46,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:46,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 14:01:46,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 14:01:46,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:46,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 14:01:47,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:47,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890785590] [2025-03-16 14:01:47,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890785590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:47,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:01:47,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:01:47,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457960391] [2025-03-16 14:01:47,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:47,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:01:47,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:47,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:01:47,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:01:47,081 INFO L87 Difference]: Start difference. First operand 159 states and 221 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:47,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:47,289 INFO L93 Difference]: Finished difference Result 513 states and 711 transitions. [2025-03-16 14:01:47,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 14:01:47,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-16 14:01:47,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:47,291 INFO L225 Difference]: With dead ends: 513 [2025-03-16 14:01:47,291 INFO L226 Difference]: Without dead ends: 383 [2025-03-16 14:01:47,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:01:47,291 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 152 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:47,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 287 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:01:47,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-16 14:01:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 159. [2025-03-16 14:01:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.3987341772151898) internal successors, (221), 158 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:47,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2025-03-16 14:01:47,300 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 39 [2025-03-16 14:01:47,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:47,300 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2025-03-16 14:01:47,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2025-03-16 14:01:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 14:01:47,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:47,301 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:47,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:01:47,301 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:47,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:47,302 INFO L85 PathProgramCache]: Analyzing trace with hash -535479614, now seen corresponding path program 1 times [2025-03-16 14:01:47,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:47,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625769971] [2025-03-16 14:01:47,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:47,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:47,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 14:01:47,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 14:01:47,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:47,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 14:01:47,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:47,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625769971] [2025-03-16 14:01:47,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625769971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:47,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:01:47,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 14:01:47,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744471977] [2025-03-16 14:01:47,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:47,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:01:47,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:47,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:01:47,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:01:47,397 INFO L87 Difference]: Start difference. First operand 159 states and 221 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:47,579 INFO L93 Difference]: Finished difference Result 493 states and 686 transitions. [2025-03-16 14:01:47,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 14:01:47,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-16 14:01:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:47,581 INFO L225 Difference]: With dead ends: 493 [2025-03-16 14:01:47,581 INFO L226 Difference]: Without dead ends: 364 [2025-03-16 14:01:47,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:01:47,581 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 141 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:47,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 252 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:01:47,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-16 14:01:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 159. [2025-03-16 14:01:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.3987341772151898) internal successors, (221), 158 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2025-03-16 14:01:47,590 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 40 [2025-03-16 14:01:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:47,590 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2025-03-16 14:01:47,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2025-03-16 14:01:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 14:01:47,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:47,595 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:47,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:01:47,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:47,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:47,596 INFO L85 PathProgramCache]: Analyzing trace with hash -502402666, now seen corresponding path program 1 times [2025-03-16 14:01:47,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:47,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143801541] [2025-03-16 14:01:47,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:47,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 14:01:47,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 14:01:47,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:47,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 14:01:47,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:47,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143801541] [2025-03-16 14:01:47,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143801541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:47,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:01:47,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 14:01:47,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581546446] [2025-03-16 14:01:47,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:47,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:01:47,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:47,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:01:47,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:01:47,736 INFO L87 Difference]: Start difference. First operand 159 states and 221 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:48,105 INFO L93 Difference]: Finished difference Result 642 states and 885 transitions. [2025-03-16 14:01:48,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 14:01:48,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-16 14:01:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:48,107 INFO L225 Difference]: With dead ends: 642 [2025-03-16 14:01:48,107 INFO L226 Difference]: Without dead ends: 512 [2025-03-16 14:01:48,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:01:48,108 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 307 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:48,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 544 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:01:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-16 14:01:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 147. [2025-03-16 14:01:48,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.3904109589041096) internal successors, (203), 146 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 203 transitions. [2025-03-16 14:01:48,116 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 203 transitions. Word has length 41 [2025-03-16 14:01:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:48,117 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 203 transitions. [2025-03-16 14:01:48,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 203 transitions. [2025-03-16 14:01:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 14:01:48,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:48,118 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:48,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:01:48,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:48,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash 920145587, now seen corresponding path program 1 times [2025-03-16 14:01:48,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:48,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919555507] [2025-03-16 14:01:48,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:48,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 14:01:48,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 14:01:48,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:48,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 14:01:48,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:48,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919555507] [2025-03-16 14:01:48,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919555507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:48,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:01:48,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:01:48,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55859998] [2025-03-16 14:01:48,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:48,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:01:48,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:48,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:01:48,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:01:48,174 INFO L87 Difference]: Start difference. First operand 147 states and 203 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:48,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:48,196 INFO L93 Difference]: Finished difference Result 217 states and 295 transitions. [2025-03-16 14:01:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:01:48,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-16 14:01:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:48,197 INFO L225 Difference]: With dead ends: 217 [2025-03-16 14:01:48,197 INFO L226 Difference]: Without dead ends: 177 [2025-03-16 14:01:48,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:01:48,198 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:48,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 142 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:01:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-16 14:01:48,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-16 14:01:48,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.3579545454545454) internal successors, (239), 176 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 239 transitions. [2025-03-16 14:01:48,207 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 239 transitions. Word has length 46 [2025-03-16 14:01:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:48,207 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 239 transitions. [2025-03-16 14:01:48,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2025-03-16 14:01:48,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 14:01:48,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:48,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:48,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:01:48,208 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:48,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:48,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1089958254, now seen corresponding path program 1 times [2025-03-16 14:01:48,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:48,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708700713] [2025-03-16 14:01:48,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:48,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:48,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 14:01:48,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 14:01:48,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:48,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:48,351 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 14:01:48,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:48,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708700713] [2025-03-16 14:01:48,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708700713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:01:48,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934317070] [2025-03-16 14:01:48,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:48,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:01:48,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:01:48,354 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 14:01:48,356 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 14:01:48,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 14:01:48,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 14:01:48,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:48,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:48,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 14:01:48,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:01:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 14:01:48,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:01:48,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934317070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:48,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:01:48,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2025-03-16 14:01:48,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686683580] [2025-03-16 14:01:48,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:48,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:01:48,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:48,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:01:48,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:01:48,427 INFO L87 Difference]: Start difference. First operand 177 states and 239 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:48,523 INFO L93 Difference]: Finished difference Result 523 states and 708 transitions. [2025-03-16 14:01:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:01:48,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-16 14:01:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:48,524 INFO L225 Difference]: With dead ends: 523 [2025-03-16 14:01:48,524 INFO L226 Difference]: Without dead ends: 331 [2025-03-16 14:01:48,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:01:48,525 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 36 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:48,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 169 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:01:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-16 14:01:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 302. [2025-03-16 14:01:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.3322259136212624) internal successors, (401), 301 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 401 transitions. [2025-03-16 14:01:48,539 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 401 transitions. Word has length 46 [2025-03-16 14:01:48,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:48,539 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 401 transitions. [2025-03-16 14:01:48,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 401 transitions. [2025-03-16 14:01:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 14:01:48,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:48,540 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:48,546 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 14:01:48,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:01:48,744 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:48,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:48,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2085137090, now seen corresponding path program 1 times [2025-03-16 14:01:48,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:48,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270314963] [2025-03-16 14:01:48,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:48,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:48,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 14:01:48,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 14:01:48,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:48,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 14:01:48,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:48,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270314963] [2025-03-16 14:01:48,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270314963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:01:48,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896002917] [2025-03-16 14:01:48,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:48,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:01:48,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:01:48,869 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 14:01:48,870 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 14:01:48,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 14:01:48,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 14:01:48,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:48,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:48,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 14:01:48,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:01:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 14:01:49,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:01:49,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896002917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:49,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:01:49,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-03-16 14:01:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016660619] [2025-03-16 14:01:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:49,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 14:01:49,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:49,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 14:01:49,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-16 14:01:49,076 INFO L87 Difference]: Start difference. First operand 302 states and 401 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:49,382 INFO L93 Difference]: Finished difference Result 961 states and 1298 transitions. [2025-03-16 14:01:49,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 14:01:49,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-16 14:01:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:49,385 INFO L225 Difference]: With dead ends: 961 [2025-03-16 14:01:49,385 INFO L226 Difference]: Without dead ends: 797 [2025-03-16 14:01:49,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-16 14:01:49,386 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 196 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:49,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 910 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:01:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-03-16 14:01:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 406. [2025-03-16 14:01:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.3358024691358024) internal successors, (541), 405 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 541 transitions. [2025-03-16 14:01:49,404 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 541 transitions. Word has length 47 [2025-03-16 14:01:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:49,404 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 541 transitions. [2025-03-16 14:01:49,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 541 transitions. [2025-03-16 14:01:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 14:01:49,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:49,405 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:49,411 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 14:01:49,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:01:49,606 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:49,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:49,607 INFO L85 PathProgramCache]: Analyzing trace with hash 149476803, now seen corresponding path program 1 times [2025-03-16 14:01:49,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:49,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456051919] [2025-03-16 14:01:49,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:49,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:49,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 14:01:49,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 14:01:49,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:49,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 14:01:49,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:49,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456051919] [2025-03-16 14:01:49,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456051919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:01:49,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885248092] [2025-03-16 14:01:49,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:49,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:01:49,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:01:49,722 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 14:01:49,723 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 14:01:49,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 14:01:49,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 14:01:49,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:49,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:49,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 14:01:49,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:01:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 14:01:49,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:01:49,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885248092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:49,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:01:49,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-03-16 14:01:49,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243950859] [2025-03-16 14:01:49,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:49,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:01:49,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:49,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:01:49,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:01:49,855 INFO L87 Difference]: Start difference. First operand 406 states and 541 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:50,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:50,134 INFO L93 Difference]: Finished difference Result 1180 states and 1598 transitions. [2025-03-16 14:01:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 14:01:50,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-16 14:01:50,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:50,137 INFO L225 Difference]: With dead ends: 1180 [2025-03-16 14:01:50,137 INFO L226 Difference]: Without dead ends: 761 [2025-03-16 14:01:50,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-16 14:01:50,139 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 194 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:50,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 250 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:01:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-16 14:01:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 680. [2025-03-16 14:01:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.2945508100147276) internal successors, (879), 679 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 879 transitions. [2025-03-16 14:01:50,160 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 879 transitions. Word has length 47 [2025-03-16 14:01:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:50,161 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 879 transitions. [2025-03-16 14:01:50,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 879 transitions. [2025-03-16 14:01:50,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 14:01:50,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:50,162 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:50,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 14:01:50,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 14:01:50,362 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:50,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:50,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1758868209, now seen corresponding path program 1 times [2025-03-16 14:01:50,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:50,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200275212] [2025-03-16 14:01:50,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:50,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:50,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 14:01:50,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 14:01:50,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:50,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 14:01:50,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:50,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200275212] [2025-03-16 14:01:50,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200275212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:50,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:01:50,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 14:01:50,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112552004] [2025-03-16 14:01:50,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:50,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:01:50,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:50,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:01:50,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:01:50,481 INFO L87 Difference]: Start difference. First operand 680 states and 879 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:50,821 INFO L93 Difference]: Finished difference Result 2164 states and 2799 transitions. [2025-03-16 14:01:50,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 14:01:50,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-16 14:01:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:50,826 INFO L225 Difference]: With dead ends: 2164 [2025-03-16 14:01:50,826 INFO L226 Difference]: Without dead ends: 1751 [2025-03-16 14:01:50,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:01:50,827 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 251 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:50,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 457 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:01:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2025-03-16 14:01:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 668. [2025-03-16 14:01:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 667 states have (on average 1.2998500749625188) internal successors, (867), 667 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:50,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 867 transitions. [2025-03-16 14:01:50,864 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 867 transitions. Word has length 48 [2025-03-16 14:01:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:50,864 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 867 transitions. [2025-03-16 14:01:50,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 867 transitions. [2025-03-16 14:01:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 14:01:50,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:50,869 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:50,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:01:50,869 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:50,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:50,870 INFO L85 PathProgramCache]: Analyzing trace with hash 239900494, now seen corresponding path program 1 times [2025-03-16 14:01:50,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:50,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698215847] [2025-03-16 14:01:50,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:50,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:50,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 14:01:50,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 14:01:50,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:50,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 14:01:50,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:50,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698215847] [2025-03-16 14:01:50,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698215847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:50,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:01:50,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 14:01:50,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470027906] [2025-03-16 14:01:50,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:50,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:01:50,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:50,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:01:50,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:01:50,962 INFO L87 Difference]: Start difference. First operand 668 states and 867 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:51,081 INFO L93 Difference]: Finished difference Result 1478 states and 1924 transitions. [2025-03-16 14:01:51,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:01:51,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-16 14:01:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:51,085 INFO L225 Difference]: With dead ends: 1478 [2025-03-16 14:01:51,085 INFO L226 Difference]: Without dead ends: 1010 [2025-03-16 14:01:51,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:01:51,087 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 28 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:51,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 192 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:01:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-16 14:01:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 907. [2025-03-16 14:01:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 1.2958057395143487) internal successors, (1174), 906 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1174 transitions. [2025-03-16 14:01:51,113 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1174 transitions. Word has length 50 [2025-03-16 14:01:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:51,113 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1174 transitions. [2025-03-16 14:01:51,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1174 transitions. [2025-03-16 14:01:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 14:01:51,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:51,114 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:51,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:01:51,114 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:51,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash 662901055, now seen corresponding path program 1 times [2025-03-16 14:01:51,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:51,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162755265] [2025-03-16 14:01:51,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:51,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:51,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 14:01:51,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 14:01:51,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:51,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 14:01:51,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:51,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162755265] [2025-03-16 14:01:51,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162755265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:01:51,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441784123] [2025-03-16 14:01:51,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:51,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:01:51,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:01:51,216 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 14:01:51,218 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 14:01:51,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 14:01:51,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 14:01:51,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:51,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:51,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 14:01:51,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:01:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 14:01:51,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:01:51,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441784123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:01:51,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:01:51,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-16 14:01:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800579098] [2025-03-16 14:01:51,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:01:51,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:01:51,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:01:51,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:01:51,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:01:51,305 INFO L87 Difference]: Start difference. First operand 907 states and 1174 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:01:51,483 INFO L93 Difference]: Finished difference Result 1925 states and 2506 transitions. [2025-03-16 14:01:51,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 14:01:51,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 14:01:51,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:01:51,487 INFO L225 Difference]: With dead ends: 1925 [2025-03-16 14:01:51,487 INFO L226 Difference]: Without dead ends: 1471 [2025-03-16 14:01:51,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:01:51,488 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 80 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:01:51,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 256 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:01:51,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2025-03-16 14:01:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1273. [2025-03-16 14:01:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1272 states have (on average 1.2900943396226414) internal successors, (1641), 1272 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:51,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1641 transitions. [2025-03-16 14:01:51,522 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1641 transitions. Word has length 51 [2025-03-16 14:01:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:01:51,522 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 1641 transitions. [2025-03-16 14:01:51,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:01:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1641 transitions. [2025-03-16 14:01:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 14:01:51,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:01:51,523 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:01:51,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 14:01:51,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 14:01:51,724 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:01:51,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:01:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1698270699, now seen corresponding path program 1 times [2025-03-16 14:01:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:01:51,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033904978] [2025-03-16 14:01:51,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:51,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:01:51,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 14:01:51,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 14:01:51,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:51,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:01:53,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:01:53,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033904978] [2025-03-16 14:01:53,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033904978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:01:53,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323311011] [2025-03-16 14:01:53,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:01:53,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:01:53,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:01:53,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:01:53,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 14:01:53,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 14:01:54,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 14:01:54,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:01:54,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:01:54,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-16 14:01:54,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:02:42,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 14:02:49,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323311011] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:02:49,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:02:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 52 [2025-03-16 14:02:49,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101499468] [2025-03-16 14:02:49,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:02:49,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-16 14:02:49,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:49,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-16 14:02:49,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=2411, Unknown=8, NotChecked=0, Total=2756 [2025-03-16 14:02:49,908 INFO L87 Difference]: Start difference. First operand 1273 states and 1641 transitions. Second operand has 53 states, 53 states have (on average 2.452830188679245) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:20,536 WARN L286 SmtUtils]: Spent 12.66s on a formula simplification. DAG size of input: 109 DAG size of output: 91 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)