./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.client_server.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.client_server.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 9ed0841be1ae1dee8e84f0ca737866704342db1241d2484eefbe911736856543 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:20:26,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:20:26,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:20:26,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:20:26,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:20:26,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:20:26,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:20:26,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:20:26,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:20:26,205 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:20:26,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:20:26,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:20:26,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:20:26,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:20:26,206 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:20:26,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:20:26,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:20:26,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:20:26,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:20:26,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:20:26,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:20:26,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:20:26,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:20:26,207 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:20:26,207 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:20:26,207 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:20:26,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:20:26,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:20:26,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:20:26,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:20:26,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:20:26,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:20:26,208 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:20:26,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:20:26,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:20:26,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:20:26,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:20:26,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:20:26,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:20:26,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:20:26,208 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ed0841be1ae1dee8e84f0ca737866704342db1241d2484eefbe911736856543 [2025-03-03 17:20:26,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:20:26,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:20:26,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:20:26,439 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:20:26,439 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:20:26,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.client_server.c [2025-03-03 17:20:26,915 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4421f7e1/68ec2b4a2dba4c38a936874114b690c5/FLAG55e761d2e [2025-03-03 17:20:28,502 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:20:28,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.client_server.c [2025-03-03 17:20:28,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4421f7e1/68ec2b4a2dba4c38a936874114b690c5/FLAG55e761d2e [2025-03-03 17:20:28,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4421f7e1/68ec2b4a2dba4c38a936874114b690c5 [2025-03-03 17:20:28,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:20:28,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:20:28,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:20:28,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:20:28,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:20:28,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:20:28" (1/1) ... [2025-03-03 17:20:28,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1e6da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28, skipping insertion in model container [2025-03-03 17:20:28,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:20:28" (1/1) ... [2025-03-03 17:20:28,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:20:28,665 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/hardware-verification-bv/btor2c-lazyMod.client_server.c[1253,1266] [2025-03-03 17:20:28,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:20:28,790 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:20:28,801 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/hardware-verification-bv/btor2c-lazyMod.client_server.c[1253,1266] [2025-03-03 17:20:28,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:20:28,906 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:20:28,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28 WrapperNode [2025-03-03 17:20:28,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:20:28,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:20:28,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:20:28,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:20:28,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28" (1/1) ... [2025-03-03 17:20:28,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28" (1/1) ... [2025-03-03 17:20:29,027 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 860 [2025-03-03 17:20:29,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:20:29,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:20:29,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:20:29,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:20:29,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28" (1/1) ... [2025-03-03 17:20:29,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28" (1/1) ... [2025-03-03 17:20:29,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28" (1/1) ... [2025-03-03 17:20:29,073 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:20:29,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28" (1/1) ... [2025-03-03 17:20:29,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28" (1/1) ... [2025-03-03 17:20:29,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28" (1/1) ... [2025-03-03 17:20:29,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28" (1/1) ... [2025-03-03 17:20:29,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28" (1/1) ... [2025-03-03 17:20:29,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28" (1/1) ... [2025-03-03 17:20:29,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:20:29,140 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:20:29,140 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:20:29,140 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:20:29,141 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28" (1/1) ... [2025-03-03 17:20:29,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:20:29,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:20:29,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:20:29,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:20:29,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:20:29,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:20:29,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:20:29,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:20:29,314 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:20:29,315 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:20:30,165 INFO L? ?]: Removed 563 outVars from TransFormulas that were not future-live. [2025-03-03 17:20:30,166 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:20:30,211 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:20:30,211 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:20:30,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:20:30 BoogieIcfgContainer [2025-03-03 17:20:30,211 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:20:30,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:20:30,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:20:30,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:20:30,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:20:28" (1/3) ... [2025-03-03 17:20:30,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ba9a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:20:30, skipping insertion in model container [2025-03-03 17:20:30,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:20:28" (2/3) ... [2025-03-03 17:20:30,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ba9a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:20:30, skipping insertion in model container [2025-03-03 17:20:30,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:20:30" (3/3) ... [2025-03-03 17:20:30,219 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.client_server.c [2025-03-03 17:20:30,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:20:30,233 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.client_server.c that has 1 procedures, 210 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:20:30,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:20:30,293 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;@20d0a13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:20:30,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:20:30,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 208 states have (on average 1.4951923076923077) internal successors, (311), 209 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:30,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 17:20:30,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:30,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:30,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:30,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash -879294502, now seen corresponding path program 1 times [2025-03-03 17:20:30,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:30,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139302764] [2025-03-03 17:20:30,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:30,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:30,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 17:20:30,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 17:20:30,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:30,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:31,112 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-03 17:20:31,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:31,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139302764] [2025-03-03 17:20:31,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139302764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:31,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:31,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:20:31,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433308457] [2025-03-03 17:20:31,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:31,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:20:31,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:31,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:20:31,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:20:31,134 INFO L87 Difference]: Start difference. First operand has 210 states, 208 states have (on average 1.4951923076923077) internal successors, (311), 209 states have internal predecessors, (311), 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 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:31,259 INFO L93 Difference]: Finished difference Result 397 states and 591 transitions. [2025-03-03 17:20:31,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:20:31,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-03 17:20:31,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:31,266 INFO L225 Difference]: With dead ends: 397 [2025-03-03 17:20:31,266 INFO L226 Difference]: Without dead ends: 209 [2025-03-03 17:20:31,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:20:31,270 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:31,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 760 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:20:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-03 17:20:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-03-03 17:20:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.4855769230769231) internal successors, (309), 208 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 309 transitions. [2025-03-03 17:20:31,313 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 309 transitions. Word has length 41 [2025-03-03 17:20:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:31,313 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 309 transitions. [2025-03-03 17:20:31,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 309 transitions. [2025-03-03 17:20:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 17:20:31,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:31,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:31,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:20:31,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:31,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1483646417, now seen corresponding path program 1 times [2025-03-03 17:20:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:31,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588933590] [2025-03-03 17:20:31,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:31,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 17:20:31,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 17:20:31,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:31,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:31,568 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-03 17:20:31,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:31,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588933590] [2025-03-03 17:20:31,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588933590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:31,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:31,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:20:31,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424997041] [2025-03-03 17:20:31,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:31,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:20:31,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:31,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:20:31,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:20:31,570 INFO L87 Difference]: Start difference. First operand 209 states and 309 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:31,695 INFO L93 Difference]: Finished difference Result 398 states and 589 transitions. [2025-03-03 17:20:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:20:31,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2025-03-03 17:20:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:31,697 INFO L225 Difference]: With dead ends: 398 [2025-03-03 17:20:31,699 INFO L226 Difference]: Without dead ends: 211 [2025-03-03 17:20:31,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:20:31,700 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:31,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 757 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:20:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-03 17:20:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-03 17:20:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.480952380952381) internal successors, (311), 210 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2025-03-03 17:20:31,714 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 42 [2025-03-03 17:20:31,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:31,715 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2025-03-03 17:20:31,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2025-03-03 17:20:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 17:20:31,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:31,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:31,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:20:31,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:31,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:31,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1111856523, now seen corresponding path program 1 times [2025-03-03 17:20:31,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:31,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231171499] [2025-03-03 17:20:31,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:31,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:31,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 17:20:31,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 17:20:31,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:31,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:32,245 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-03 17:20:32,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:32,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231171499] [2025-03-03 17:20:32,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231171499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:32,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:32,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:20:32,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165099013] [2025-03-03 17:20:32,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:32,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:20:32,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:32,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:20:32,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:20:32,247 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 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-03 17:20:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:32,441 INFO L93 Difference]: Finished difference Result 408 states and 602 transitions. [2025-03-03 17:20:32,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:20:32,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 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 43 [2025-03-03 17:20:32,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:32,443 INFO L225 Difference]: With dead ends: 408 [2025-03-03 17:20:32,443 INFO L226 Difference]: Without dead ends: 219 [2025-03-03 17:20:32,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:20:32,444 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 5 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:32,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1252 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:20:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-03 17:20:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2025-03-03 17:20:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.4744186046511627) internal successors, (317), 215 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 317 transitions. [2025-03-03 17:20:32,456 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 317 transitions. Word has length 43 [2025-03-03 17:20:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:32,456 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 317 transitions. [2025-03-03 17:20:32,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 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-03 17:20:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 317 transitions. [2025-03-03 17:20:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 17:20:32,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:32,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:32,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:20:32,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:32,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:32,458 INFO L85 PathProgramCache]: Analyzing trace with hash 989804998, now seen corresponding path program 1 times [2025-03-03 17:20:32,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:32,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246336110] [2025-03-03 17:20:32,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:32,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:32,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 17:20:32,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 17:20:32,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:32,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:32,835 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-03 17:20:32,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:32,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246336110] [2025-03-03 17:20:32,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246336110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:32,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:32,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:20:32,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253504856] [2025-03-03 17:20:32,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:32,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:20:32,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:32,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:20:32,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:20:32,838 INFO L87 Difference]: Start difference. First operand 216 states and 317 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-03 17:20:32,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:32,999 INFO L93 Difference]: Finished difference Result 414 states and 608 transitions. [2025-03-03 17:20:32,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:20:32,999 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 44 [2025-03-03 17:20:33,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:33,001 INFO L225 Difference]: With dead ends: 414 [2025-03-03 17:20:33,001 INFO L226 Difference]: Without dead ends: 220 [2025-03-03 17:20:33,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:20:33,002 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 277 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:33,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 713 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:20:33,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-03 17:20:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2025-03-03 17:20:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.4678899082568808) internal successors, (320), 218 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 320 transitions. [2025-03-03 17:20:33,014 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 320 transitions. Word has length 44 [2025-03-03 17:20:33,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:33,014 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 320 transitions. [2025-03-03 17:20:33,014 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-03 17:20:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 320 transitions. [2025-03-03 17:20:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 17:20:33,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:33,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:33,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:20:33,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:33,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:33,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1106748194, now seen corresponding path program 1 times [2025-03-03 17:20:33,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:33,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152727688] [2025-03-03 17:20:33,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:33,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:33,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 17:20:33,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 17:20:33,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:33,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:33,635 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-03 17:20:33,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:33,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152727688] [2025-03-03 17:20:33,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152727688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:33,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:33,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:20:33,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611168501] [2025-03-03 17:20:33,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:33,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:20:33,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:33,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:20:33,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:20:33,638 INFO L87 Difference]: Start difference. First operand 219 states and 320 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:33,911 INFO L93 Difference]: Finished difference Result 557 states and 812 transitions. [2025-03-03 17:20:33,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:20:33,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 45 [2025-03-03 17:20:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:33,912 INFO L225 Difference]: With dead ends: 557 [2025-03-03 17:20:33,912 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 17:20:33,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:20:33,913 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 680 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:33,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 929 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:20:33,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 17:20:33,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 221. [2025-03-03 17:20:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.4636363636363636) internal successors, (322), 220 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 322 transitions. [2025-03-03 17:20:33,920 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 322 transitions. Word has length 45 [2025-03-03 17:20:33,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:33,920 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 322 transitions. [2025-03-03 17:20:33,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 322 transitions. [2025-03-03 17:20:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 17:20:33,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:33,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:33,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:20:33,921 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:33,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:33,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1973882260, now seen corresponding path program 1 times [2025-03-03 17:20:33,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:33,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728584130] [2025-03-03 17:20:33,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:33,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:33,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 17:20:34,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 17:20:34,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:34,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:34,375 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-03 17:20:34,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:34,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728584130] [2025-03-03 17:20:34,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728584130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:34,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:34,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:20:34,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016533326] [2025-03-03 17:20:34,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:34,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:20:34,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:34,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:20:34,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:20:34,380 INFO L87 Difference]: Start difference. First operand 221 states and 322 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:34,546 INFO L93 Difference]: Finished difference Result 427 states and 623 transitions. [2025-03-03 17:20:34,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:20:34,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 45 [2025-03-03 17:20:34,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:34,548 INFO L225 Difference]: With dead ends: 427 [2025-03-03 17:20:34,548 INFO L226 Difference]: Without dead ends: 230 [2025-03-03 17:20:34,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:20:34,549 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 7 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:34,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1240 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:20:34,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-03 17:20:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 225. [2025-03-03 17:20:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.4598214285714286) internal successors, (327), 224 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 327 transitions. [2025-03-03 17:20:34,554 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 327 transitions. Word has length 45 [2025-03-03 17:20:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:34,554 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 327 transitions. [2025-03-03 17:20:34,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 327 transitions. [2025-03-03 17:20:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 17:20:34,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:34,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:34,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:20:34,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:34,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1747448793, now seen corresponding path program 1 times [2025-03-03 17:20:34,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:34,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859917699] [2025-03-03 17:20:34,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:34,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:34,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 17:20:34,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 17:20:34,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:34,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:35,026 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-03 17:20:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:35,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859917699] [2025-03-03 17:20:35,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859917699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:35,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:35,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:20:35,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805280229] [2025-03-03 17:20:35,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:35,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:20:35,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:35,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:20:35,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:20:35,028 INFO L87 Difference]: Start difference. First operand 225 states and 327 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:35,226 INFO L93 Difference]: Finished difference Result 585 states and 850 transitions. [2025-03-03 17:20:35,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:20:35,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 45 [2025-03-03 17:20:35,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:35,227 INFO L225 Difference]: With dead ends: 585 [2025-03-03 17:20:35,227 INFO L226 Difference]: Without dead ends: 384 [2025-03-03 17:20:35,228 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-03 17:20:35,228 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 734 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:35,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 696 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:20:35,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-03 17:20:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 227. [2025-03-03 17:20:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4557522123893805) internal successors, (329), 226 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 329 transitions. [2025-03-03 17:20:35,233 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 329 transitions. Word has length 45 [2025-03-03 17:20:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:35,234 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 329 transitions. [2025-03-03 17:20:35,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 329 transitions. [2025-03-03 17:20:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 17:20:35,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:35,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:35,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:20:35,235 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:35,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash 631263165, now seen corresponding path program 1 times [2025-03-03 17:20:35,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:35,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428906450] [2025-03-03 17:20:35,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:35,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:35,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 17:20:35,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 17:20:35,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:35,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:35,535 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-03 17:20:35,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:35,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428906450] [2025-03-03 17:20:35,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428906450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:35,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:35,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:20:35,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746352325] [2025-03-03 17:20:35,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:35,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:20:35,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:35,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:20:35,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:20:35,537 INFO L87 Difference]: Start difference. First operand 227 states and 329 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:35,696 INFO L93 Difference]: Finished difference Result 437 states and 635 transitions. [2025-03-03 17:20:35,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:20:35,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-03 17:20:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:35,698 INFO L225 Difference]: With dead ends: 437 [2025-03-03 17:20:35,698 INFO L226 Difference]: Without dead ends: 236 [2025-03-03 17:20:35,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:20:35,699 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 7 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:35,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1240 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:20:35,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-03 17:20:35,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 231. [2025-03-03 17:20:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4521739130434783) internal successors, (334), 230 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 334 transitions. [2025-03-03 17:20:35,703 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 334 transitions. Word has length 46 [2025-03-03 17:20:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:35,703 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 334 transitions. [2025-03-03 17:20:35,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 334 transitions. [2025-03-03 17:20:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 17:20:35,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:35,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:35,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:20:35,704 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:35,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash -384860424, now seen corresponding path program 1 times [2025-03-03 17:20:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:35,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051385120] [2025-03-03 17:20:35,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:35,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:35,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 17:20:35,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 17:20:35,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:35,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:36,129 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-03 17:20:36,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:36,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051385120] [2025-03-03 17:20:36,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051385120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:36,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:36,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:20:36,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511553241] [2025-03-03 17:20:36,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:36,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:20:36,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:36,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:20:36,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:20:36,131 INFO L87 Difference]: Start difference. First operand 231 states and 334 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:36,353 INFO L93 Difference]: Finished difference Result 617 states and 894 transitions. [2025-03-03 17:20:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:20:36,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-03 17:20:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:36,355 INFO L225 Difference]: With dead ends: 617 [2025-03-03 17:20:36,355 INFO L226 Difference]: Without dead ends: 412 [2025-03-03 17:20:36,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:20:36,356 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 794 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:36,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 700 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:20:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-03 17:20:36,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 236. [2025-03-03 17:20:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.4425531914893617) internal successors, (339), 235 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 339 transitions. [2025-03-03 17:20:36,362 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 339 transitions. Word has length 46 [2025-03-03 17:20:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:36,362 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 339 transitions. [2025-03-03 17:20:36,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 339 transitions. [2025-03-03 17:20:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 17:20:36,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:36,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:36,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:20:36,363 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:36,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:36,364 INFO L85 PathProgramCache]: Analyzing trace with hash 623302102, now seen corresponding path program 1 times [2025-03-03 17:20:36,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:36,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127430244] [2025-03-03 17:20:36,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:36,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:36,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 17:20:36,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 17:20:36,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:36,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:36,655 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-03 17:20:36,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:36,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127430244] [2025-03-03 17:20:36,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127430244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:36,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:36,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:20:36,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800447999] [2025-03-03 17:20:36,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:36,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:20:36,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:36,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:20:36,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:20:36,656 INFO L87 Difference]: Start difference. First operand 236 states and 339 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:36,816 INFO L93 Difference]: Finished difference Result 450 states and 650 transitions. [2025-03-03 17:20:36,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:20:36,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-03 17:20:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:36,818 INFO L225 Difference]: With dead ends: 450 [2025-03-03 17:20:36,819 INFO L226 Difference]: Without dead ends: 245 [2025-03-03 17:20:36,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:20:36,820 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 7 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:36,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1240 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:20:36,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-03 17:20:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 240. [2025-03-03 17:20:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.4393305439330544) internal successors, (344), 239 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 344 transitions. [2025-03-03 17:20:36,828 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 344 transitions. Word has length 47 [2025-03-03 17:20:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:36,829 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 344 transitions. [2025-03-03 17:20:36,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 344 transitions. [2025-03-03 17:20:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 17:20:36,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:36,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:36,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:20:36,830 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:36,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash -118695279, now seen corresponding path program 1 times [2025-03-03 17:20:36,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:36,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812842225] [2025-03-03 17:20:36,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:36,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:36,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 17:20:36,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 17:20:36,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:36,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:37,474 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-03 17:20:37,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:37,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812842225] [2025-03-03 17:20:37,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812842225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:37,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:37,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:20:37,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289154877] [2025-03-03 17:20:37,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:37,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:20:37,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:37,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:20:37,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:20:37,476 INFO L87 Difference]: Start difference. First operand 240 states and 344 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:37,822 INFO L93 Difference]: Finished difference Result 559 states and 803 transitions. [2025-03-03 17:20:37,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:20:37,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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-03 17:20:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:37,824 INFO L225 Difference]: With dead ends: 559 [2025-03-03 17:20:37,824 INFO L226 Difference]: Without dead ends: 350 [2025-03-03 17:20:37,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:20:37,825 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 437 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:37,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1487 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:20:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-03 17:20:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 245. [2025-03-03 17:20:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.4344262295081966) internal successors, (350), 244 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 350 transitions. [2025-03-03 17:20:37,833 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 350 transitions. Word has length 47 [2025-03-03 17:20:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:37,834 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 350 transitions. [2025-03-03 17:20:37,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 350 transitions. [2025-03-03 17:20:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 17:20:37,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:37,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:37,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:20:37,834 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:37,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:37,834 INFO L85 PathProgramCache]: Analyzing trace with hash 526893366, now seen corresponding path program 1 times [2025-03-03 17:20:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:37,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798622138] [2025-03-03 17:20:37,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:37,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:37,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 17:20:37,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 17:20:37,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:37,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:38,300 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-03 17:20:38,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:38,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798622138] [2025-03-03 17:20:38,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798622138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:38,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:38,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:20:38,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699052728] [2025-03-03 17:20:38,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:38,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:20:38,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:38,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:20:38,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:20:38,301 INFO L87 Difference]: Start difference. First operand 245 states and 350 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:38,539 INFO L93 Difference]: Finished difference Result 468 states and 673 transitions. [2025-03-03 17:20:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:20:38,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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-03 17:20:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:38,541 INFO L225 Difference]: With dead ends: 468 [2025-03-03 17:20:38,541 INFO L226 Difference]: Without dead ends: 259 [2025-03-03 17:20:38,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:20:38,542 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 9 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:38,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1746 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:20:38,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-03 17:20:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2025-03-03 17:20:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.4291338582677164) internal successors, (363), 254 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 363 transitions. [2025-03-03 17:20:38,550 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 363 transitions. Word has length 47 [2025-03-03 17:20:38,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:38,550 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 363 transitions. [2025-03-03 17:20:38,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 363 transitions. [2025-03-03 17:20:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 17:20:38,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:38,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:38,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 17:20:38,550 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:38,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2129978526, now seen corresponding path program 1 times [2025-03-03 17:20:38,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:38,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214192225] [2025-03-03 17:20:38,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:38,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:38,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 17:20:38,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 17:20:38,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:38,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:38,941 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-03 17:20:38,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:38,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214192225] [2025-03-03 17:20:38,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214192225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:38,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:38,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:20:38,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194226372] [2025-03-03 17:20:38,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:38,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:20:38,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:38,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:20:38,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:20:38,943 INFO L87 Difference]: Start difference. First operand 255 states and 363 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:39,184 INFO L93 Difference]: Finished difference Result 640 states and 921 transitions. [2025-03-03 17:20:39,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:20:39,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-03 17:20:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:39,187 INFO L225 Difference]: With dead ends: 640 [2025-03-03 17:20:39,187 INFO L226 Difference]: Without dead ends: 421 [2025-03-03 17:20:39,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:20:39,188 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 762 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:39,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 930 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:20:39,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-03 17:20:39,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 263. [2025-03-03 17:20:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4198473282442747) internal successors, (372), 262 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 372 transitions. [2025-03-03 17:20:39,195 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 372 transitions. Word has length 48 [2025-03-03 17:20:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:39,196 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 372 transitions. [2025-03-03 17:20:39,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 372 transitions. [2025-03-03 17:20:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 17:20:39,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:39,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:39,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 17:20:39,196 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:39,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:39,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2128117465, now seen corresponding path program 1 times [2025-03-03 17:20:39,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:39,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236112198] [2025-03-03 17:20:39,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:39,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:39,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 17:20:39,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 17:20:39,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:39,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:39,469 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-03 17:20:39,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:39,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236112198] [2025-03-03 17:20:39,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236112198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:39,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:39,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:20:39,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018621423] [2025-03-03 17:20:39,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:39,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:20:39,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:39,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:20:39,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:20:39,471 INFO L87 Difference]: Start difference. First operand 263 states and 372 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:39,639 INFO L93 Difference]: Finished difference Result 491 states and 702 transitions. [2025-03-03 17:20:39,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:20:39,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-03 17:20:39,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:39,641 INFO L225 Difference]: With dead ends: 491 [2025-03-03 17:20:39,641 INFO L226 Difference]: Without dead ends: 272 [2025-03-03 17:20:39,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:20:39,642 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 7 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:39,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1484 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:20:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-03 17:20:39,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 267. [2025-03-03 17:20:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.4172932330827068) internal successors, (377), 266 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 377 transitions. [2025-03-03 17:20:39,649 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 377 transitions. Word has length 48 [2025-03-03 17:20:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:39,649 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 377 transitions. [2025-03-03 17:20:39,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 377 transitions. [2025-03-03 17:20:39,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 17:20:39,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:39,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:39,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 17:20:39,650 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:39,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:39,650 INFO L85 PathProgramCache]: Analyzing trace with hash -727319064, now seen corresponding path program 1 times [2025-03-03 17:20:39,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:39,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285516691] [2025-03-03 17:20:39,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:39,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:39,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 17:20:39,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 17:20:39,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:39,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:40,147 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-03 17:20:40,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:40,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285516691] [2025-03-03 17:20:40,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285516691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:40,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:40,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 17:20:40,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843171069] [2025-03-03 17:20:40,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:40,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 17:20:40,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:40,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 17:20:40,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2025-03-03 17:20:40,149 INFO L87 Difference]: Start difference. First operand 267 states and 377 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:40,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:40,857 INFO L93 Difference]: Finished difference Result 529 states and 754 transitions. [2025-03-03 17:20:40,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 17:20:40,857 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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-03 17:20:40,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:40,858 INFO L225 Difference]: With dead ends: 529 [2025-03-03 17:20:40,858 INFO L226 Difference]: Without dead ends: 306 [2025-03-03 17:20:40,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2025-03-03 17:20:40,860 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 25 mSDsluCounter, 4058 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4300 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:40,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4300 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 17:20:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-03 17:20:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2025-03-03 17:20:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.42) internal successors, (426), 300 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 426 transitions. [2025-03-03 17:20:40,866 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 426 transitions. Word has length 48 [2025-03-03 17:20:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:40,866 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 426 transitions. [2025-03-03 17:20:40,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 426 transitions. [2025-03-03 17:20:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 17:20:40,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:40,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:40,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 17:20:40,867 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:40,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:40,868 INFO L85 PathProgramCache]: Analyzing trace with hash -586355183, now seen corresponding path program 1 times [2025-03-03 17:20:40,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:40,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9553862] [2025-03-03 17:20:40,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:40,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:40,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 17:20:40,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 17:20:40,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:40,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:41,241 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-03 17:20:41,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:41,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9553862] [2025-03-03 17:20:41,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9553862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:41,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:41,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 17:20:41,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735647729] [2025-03-03 17:20:41,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:41,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 17:20:41,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:41,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 17:20:41,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:20:41,243 INFO L87 Difference]: Start difference. First operand 301 states and 426 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:41,585 INFO L93 Difference]: Finished difference Result 561 states and 801 transitions. [2025-03-03 17:20:41,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 17:20:41,586 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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-03 17:20:41,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:41,587 INFO L225 Difference]: With dead ends: 561 [2025-03-03 17:20:41,587 INFO L226 Difference]: Without dead ends: 301 [2025-03-03 17:20:41,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:20:41,588 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 14 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:41,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2481 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:20:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-03 17:20:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2025-03-03 17:20:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.419463087248322) internal successors, (423), 298 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 423 transitions. [2025-03-03 17:20:41,594 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 423 transitions. Word has length 48 [2025-03-03 17:20:41,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:41,594 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 423 transitions. [2025-03-03 17:20:41,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 423 transitions. [2025-03-03 17:20:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 17:20:41,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:41,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:41,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 17:20:41,595 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:41,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1773055237, now seen corresponding path program 1 times [2025-03-03 17:20:41,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:41,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112823918] [2025-03-03 17:20:41,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:41,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:41,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 17:20:41,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 17:20:41,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:41,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:42,071 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-03 17:20:42,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:42,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112823918] [2025-03-03 17:20:42,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112823918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:42,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:42,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:20:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414459434] [2025-03-03 17:20:42,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:42,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:20:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:42,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:20:42,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:20:42,073 INFO L87 Difference]: Start difference. First operand 299 states and 423 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:42,302 INFO L93 Difference]: Finished difference Result 670 states and 956 transitions. [2025-03-03 17:20:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:20:42,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 49 [2025-03-03 17:20:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:42,304 INFO L225 Difference]: With dead ends: 670 [2025-03-03 17:20:42,304 INFO L226 Difference]: Without dead ends: 412 [2025-03-03 17:20:42,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:20:42,305 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 599 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:42,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 929 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:20:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-03 17:20:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 307. [2025-03-03 17:20:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.411764705882353) internal successors, (432), 306 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 432 transitions. [2025-03-03 17:20:42,311 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 432 transitions. Word has length 49 [2025-03-03 17:20:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:42,311 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 432 transitions. [2025-03-03 17:20:42,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 432 transitions. [2025-03-03 17:20:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 17:20:42,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:42,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:42,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 17:20:42,314 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:42,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:42,315 INFO L85 PathProgramCache]: Analyzing trace with hash -644275752, now seen corresponding path program 1 times [2025-03-03 17:20:42,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:42,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713018806] [2025-03-03 17:20:42,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:42,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:42,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 17:20:42,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 17:20:42,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:42,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:42,786 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-03 17:20:42,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:42,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713018806] [2025-03-03 17:20:42,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713018806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:42,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:42,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 17:20:42,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792163153] [2025-03-03 17:20:42,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:42,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 17:20:42,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:42,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 17:20:42,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2025-03-03 17:20:42,788 INFO L87 Difference]: Start difference. First operand 307 states and 432 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:43,373 INFO L93 Difference]: Finished difference Result 570 states and 810 transitions. [2025-03-03 17:20:43,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 17:20:43,373 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 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 49 [2025-03-03 17:20:43,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:43,375 INFO L225 Difference]: With dead ends: 570 [2025-03-03 17:20:43,375 INFO L226 Difference]: Without dead ends: 312 [2025-03-03 17:20:43,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2025-03-03 17:20:43,375 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 24 mSDsluCounter, 3670 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3918 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:43,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3918 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:20:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-03 17:20:43,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2025-03-03 17:20:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.4104234527687296) internal successors, (433), 307 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:43,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 433 transitions. [2025-03-03 17:20:43,381 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 433 transitions. Word has length 49 [2025-03-03 17:20:43,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:43,381 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 433 transitions. [2025-03-03 17:20:43,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 433 transitions. [2025-03-03 17:20:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 17:20:43,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:43,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:43,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 17:20:43,384 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:43,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:43,384 INFO L85 PathProgramCache]: Analyzing trace with hash 243569011, now seen corresponding path program 1 times [2025-03-03 17:20:43,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:43,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192200829] [2025-03-03 17:20:43,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:43,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:43,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 17:20:43,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 17:20:43,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:43,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:43,853 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-03 17:20:43,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:43,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192200829] [2025-03-03 17:20:43,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192200829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:43,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:43,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 17:20:43,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940666463] [2025-03-03 17:20:43,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:43,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 17:20:43,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:43,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 17:20:43,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:20:43,855 INFO L87 Difference]: Start difference. First operand 308 states and 433 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:44,298 INFO L93 Difference]: Finished difference Result 571 states and 811 transitions. [2025-03-03 17:20:44,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 17:20:44,298 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 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 49 [2025-03-03 17:20:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:44,300 INFO L225 Difference]: With dead ends: 571 [2025-03-03 17:20:44,300 INFO L226 Difference]: Without dead ends: 309 [2025-03-03 17:20:44,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:20:44,300 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 19 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:44,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3210 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:20:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-03 17:20:44,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2025-03-03 17:20:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.4098360655737705) internal successors, (430), 305 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 430 transitions. [2025-03-03 17:20:44,305 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 430 transitions. Word has length 49 [2025-03-03 17:20:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:44,305 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 430 transitions. [2025-03-03 17:20:44,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 430 transitions. [2025-03-03 17:20:44,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 17:20:44,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:44,306 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:44,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 17:20:44,307 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:44,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:44,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1088380397, now seen corresponding path program 1 times [2025-03-03 17:20:44,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:44,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126469868] [2025-03-03 17:20:44,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:44,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:44,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 17:20:44,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 17:20:44,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:44,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 17:20:46,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:46,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126469868] [2025-03-03 17:20:46,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126469868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:20:46,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686656655] [2025-03-03 17:20:46,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:46,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:20:46,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:20:46,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:20:46,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:20:46,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 17:20:47,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 17:20:47,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:47,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:47,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 17:20:47,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:20:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:20:47,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:20:47,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686656655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:47,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:20:47,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2025-03-03 17:20:47,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397830787] [2025-03-03 17:20:47,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:47,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:20:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:47,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:20:47,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-03 17:20:47,512 INFO L87 Difference]: Start difference. First operand 306 states and 430 transitions. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:48,028 INFO L93 Difference]: Finished difference Result 764 states and 1096 transitions. [2025-03-03 17:20:48,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:20:48,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 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 143 [2025-03-03 17:20:48,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:48,030 INFO L225 Difference]: With dead ends: 764 [2025-03-03 17:20:48,030 INFO L226 Difference]: Without dead ends: 504 [2025-03-03 17:20:48,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-03-03 17:20:48,030 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 972 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:48,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 690 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:20:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-03 17:20:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 334. [2025-03-03 17:20:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.3993993993993994) internal successors, (466), 333 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 466 transitions. [2025-03-03 17:20:48,036 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 466 transitions. Word has length 143 [2025-03-03 17:20:48,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:48,036 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 466 transitions. [2025-03-03 17:20:48,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 466 transitions. [2025-03-03 17:20:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 17:20:48,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:48,037 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:48,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 17:20:48,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:20:48,241 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:48,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1920749217, now seen corresponding path program 1 times [2025-03-03 17:20:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:48,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607489932] [2025-03-03 17:20:48,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:48,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:48,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 17:20:49,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 17:20:49,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:49,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 17:20:52,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:52,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607489932] [2025-03-03 17:20:52,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607489932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:20:52,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572826096] [2025-03-03 17:20:52,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:52,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:20:52,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:20:52,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:20:52,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 17:20:52,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 17:20:52,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 17:20:52,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:52,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:52,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 17:20:52,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:20:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:20:53,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:20:53,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572826096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:53,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:20:53,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2025-03-03 17:20:53,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614053136] [2025-03-03 17:20:53,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:53,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:20:53,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:53,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:20:53,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-03-03 17:20:53,028 INFO L87 Difference]: Start difference. First operand 334 states and 466 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:53,345 INFO L93 Difference]: Finished difference Result 650 states and 924 transitions. [2025-03-03 17:20:53,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:20:53,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 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 144 [2025-03-03 17:20:53,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:53,346 INFO L225 Difference]: With dead ends: 650 [2025-03-03 17:20:53,347 INFO L226 Difference]: Without dead ends: 390 [2025-03-03 17:20:53,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2025-03-03 17:20:53,348 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 324 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:53,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 748 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:20:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-03 17:20:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 339. [2025-03-03 17:20:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.3964497041420119) internal successors, (472), 338 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 472 transitions. [2025-03-03 17:20:53,354 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 472 transitions. Word has length 144 [2025-03-03 17:20:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:53,354 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 472 transitions. [2025-03-03 17:20:53,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 472 transitions. [2025-03-03 17:20:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 17:20:53,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:53,355 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:53,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 17:20:53,556 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,SelfDestructingSolverStorable20 [2025-03-03 17:20:53,556 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:53,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1108644647, now seen corresponding path program 1 times [2025-03-03 17:20:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:53,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742591574] [2025-03-03 17:20:53,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:53,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:53,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 17:20:54,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 17:20:54,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:54,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:20:54,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:54,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742591574] [2025-03-03 17:20:54,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742591574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:54,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:54,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:20:54,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328054138] [2025-03-03 17:20:54,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:54,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:20:54,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:54,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:20:54,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:20:54,596 INFO L87 Difference]: Start difference. First operand 339 states and 472 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:54,868 INFO L93 Difference]: Finished difference Result 606 states and 855 transitions. [2025-03-03 17:20:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:20:54,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 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 145 [2025-03-03 17:20:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:54,869 INFO L225 Difference]: With dead ends: 606 [2025-03-03 17:20:54,869 INFO L226 Difference]: Without dead ends: 341 [2025-03-03 17:20:54,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:20:54,873 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 248 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:54,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 662 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:20:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-03 17:20:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 340. [2025-03-03 17:20:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 1.3952802359882006) internal successors, (473), 339 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 473 transitions. [2025-03-03 17:20:54,880 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 473 transitions. Word has length 145 [2025-03-03 17:20:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:54,881 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 473 transitions. [2025-03-03 17:20:54,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 473 transitions. [2025-03-03 17:20:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 17:20:54,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:54,882 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:54,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 17:20:54,883 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:54,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:54,883 INFO L85 PathProgramCache]: Analyzing trace with hash -976290260, now seen corresponding path program 1 times [2025-03-03 17:20:54,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:54,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412115785] [2025-03-03 17:20:54,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:54,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:54,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 17:20:55,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 17:20:55,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:55,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:20:55,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:55,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412115785] [2025-03-03 17:20:55,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412115785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:55,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:55,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:20:55,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877160482] [2025-03-03 17:20:55,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:55,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:20:55,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:55,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:20:55,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:20:55,788 INFO L87 Difference]: Start difference. First operand 340 states and 473 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:55,979 INFO L93 Difference]: Finished difference Result 727 states and 1033 transitions. [2025-03-03 17:20:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:20:55,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 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 145 [2025-03-03 17:20:55,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:55,981 INFO L225 Difference]: With dead ends: 727 [2025-03-03 17:20:55,981 INFO L226 Difference]: Without dead ends: 461 [2025-03-03 17:20:55,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:20:55,981 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 466 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:55,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1043 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:20:55,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-03 17:20:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 377. [2025-03-03 17:20:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.398936170212766) internal successors, (526), 376 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 526 transitions. [2025-03-03 17:20:55,986 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 526 transitions. Word has length 145 [2025-03-03 17:20:55,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:55,986 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 526 transitions. [2025-03-03 17:20:55,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:55,987 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 526 transitions. [2025-03-03 17:20:55,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 17:20:55,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:55,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:55,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 17:20:55,988 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:55,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:55,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1018636958, now seen corresponding path program 1 times [2025-03-03 17:20:55,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:55,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410946352] [2025-03-03 17:20:55,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:55,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:56,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 17:20:56,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 17:20:56,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:56,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 17:20:58,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:58,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410946352] [2025-03-03 17:20:58,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410946352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:20:58,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309604217] [2025-03-03 17:20:58,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:58,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:20:58,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:20:58,085 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:20:58,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 17:20:58,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 17:20:58,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 17:20:58,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:58,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:58,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-03 17:20:58,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:20:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:20:59,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:20:59,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309604217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:59,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:20:59,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2025-03-03 17:20:59,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112568173] [2025-03-03 17:20:59,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:59,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 17:20:59,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:59,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 17:20:59,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-03-03 17:20:59,298 INFO L87 Difference]: Start difference. First operand 377 states and 526 transitions. Second operand has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 11 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:59,770 INFO L93 Difference]: Finished difference Result 785 states and 1117 transitions. [2025-03-03 17:20:59,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 17:20:59,770 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 11 states have internal predecessors, (145), 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 145 [2025-03-03 17:20:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:59,772 INFO L225 Difference]: With dead ends: 785 [2025-03-03 17:20:59,772 INFO L226 Difference]: Without dead ends: 519 [2025-03-03 17:20:59,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-03 17:20:59,773 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 615 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:59,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 951 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:20:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-03 17:20:59,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 408. [2025-03-03 17:20:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.4004914004914004) internal successors, (570), 407 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 570 transitions. [2025-03-03 17:20:59,778 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 570 transitions. Word has length 145 [2025-03-03 17:20:59,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:59,778 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 570 transitions. [2025-03-03 17:20:59,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 11 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:20:59,778 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 570 transitions. [2025-03-03 17:20:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 17:20:59,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:59,779 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:59,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 17:20:59,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:20:59,980 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:59,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:59,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1518153690, now seen corresponding path program 1 times [2025-03-03 17:20:59,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:59,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608085677] [2025-03-03 17:20:59,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:59,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:21:00,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 17:21:00,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 17:21:00,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:00,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:01,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:21:01,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608085677] [2025-03-03 17:21:01,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608085677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:21:01,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:21:01,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:21:01,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395265960] [2025-03-03 17:21:01,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:21:01,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:21:01,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:21:01,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:21:01,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:21:01,130 INFO L87 Difference]: Start difference. First operand 408 states and 570 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:01,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:21:01,307 INFO L93 Difference]: Finished difference Result 679 states and 958 transitions. [2025-03-03 17:21:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:21:01,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 146 [2025-03-03 17:21:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:21:01,308 INFO L225 Difference]: With dead ends: 679 [2025-03-03 17:21:01,308 INFO L226 Difference]: Without dead ends: 406 [2025-03-03 17:21:01,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:21:01,309 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 2 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:21:01,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 827 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:21:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-03 17:21:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-03-03 17:21:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.3975308641975308) internal successors, (566), 405 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 566 transitions. [2025-03-03 17:21:01,314 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 566 transitions. Word has length 146 [2025-03-03 17:21:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:21:01,314 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 566 transitions. [2025-03-03 17:21:01,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 566 transitions. [2025-03-03 17:21:01,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 17:21:01,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:21:01,315 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:21:01,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 17:21:01,315 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:21:01,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:21:01,315 INFO L85 PathProgramCache]: Analyzing trace with hash 165720900, now seen corresponding path program 1 times [2025-03-03 17:21:01,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:21:01,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480341582] [2025-03-03 17:21:01,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:01,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:21:01,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 17:21:01,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 17:21:01,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:01,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:01,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:21:01,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480341582] [2025-03-03 17:21:01,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480341582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:21:01,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:21:01,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:21:01,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476732449] [2025-03-03 17:21:01,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:21:01,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:21:01,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:21:01,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:21:01,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:21:01,661 INFO L87 Difference]: Start difference. First operand 406 states and 566 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:21:01,877 INFO L93 Difference]: Finished difference Result 920 states and 1299 transitions. [2025-03-03 17:21:01,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:21:01,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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 146 [2025-03-03 17:21:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:21:01,878 INFO L225 Difference]: With dead ends: 920 [2025-03-03 17:21:01,878 INFO L226 Difference]: Without dead ends: 414 [2025-03-03 17:21:01,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:21:01,879 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 138 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:21:01,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1425 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:21:01,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-03 17:21:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 410. [2025-03-03 17:21:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.3936430317848412) internal successors, (570), 409 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 570 transitions. [2025-03-03 17:21:01,885 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 570 transitions. Word has length 146 [2025-03-03 17:21:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:21:01,885 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 570 transitions. [2025-03-03 17:21:01,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 570 transitions. [2025-03-03 17:21:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 17:21:01,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:21:01,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:21:01,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 17:21:01,899 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:21:01,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:21:01,900 INFO L85 PathProgramCache]: Analyzing trace with hash -990646396, now seen corresponding path program 1 times [2025-03-03 17:21:01,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:21:01,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003654365] [2025-03-03 17:21:01,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:01,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:21:01,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 17:21:02,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 17:21:02,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:02,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 17:21:04,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:21:04,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003654365] [2025-03-03 17:21:04,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003654365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:21:04,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188091786] [2025-03-03 17:21:04,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:04,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:21:04,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:21:04,163 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:21:04,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 17:21:04,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 17:21:04,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 17:21:04,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:04,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:04,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-03 17:21:04,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:21:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:05,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:21:05,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188091786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:21:05,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:21:05,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [13] total 31 [2025-03-03 17:21:05,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890340365] [2025-03-03 17:21:05,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:21:05,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 17:21:05,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:21:05,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 17:21:05,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2025-03-03 17:21:05,416 INFO L87 Difference]: Start difference. First operand 410 states and 570 transitions. Second operand has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:21:06,412 INFO L93 Difference]: Finished difference Result 917 states and 1297 transitions. [2025-03-03 17:21:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 17:21:06,412 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 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 146 [2025-03-03 17:21:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:21:06,414 INFO L225 Difference]: With dead ends: 917 [2025-03-03 17:21:06,414 INFO L226 Difference]: Without dead ends: 650 [2025-03-03 17:21:06,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=1486, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 17:21:06,415 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1028 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 2531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 17:21:06,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 2151 Invalid, 2531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 17:21:06,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-03 17:21:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 503. [2025-03-03 17:21:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 1.408366533864542) internal successors, (707), 502 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 707 transitions. [2025-03-03 17:21:06,422 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 707 transitions. Word has length 146 [2025-03-03 17:21:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:21:06,422 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 707 transitions. [2025-03-03 17:21:06,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 707 transitions. [2025-03-03 17:21:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 17:21:06,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:21:06,424 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:21:06,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 17:21:06,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 17:21:06,624 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:21:06,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:21:06,625 INFO L85 PathProgramCache]: Analyzing trace with hash -908422425, now seen corresponding path program 1 times [2025-03-03 17:21:06,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:21:06,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681442203] [2025-03-03 17:21:06,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:06,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:21:06,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 17:21:06,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 17:21:06,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:06,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:07,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:21:07,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681442203] [2025-03-03 17:21:07,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681442203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:21:07,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:21:07,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 17:21:07,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073954612] [2025-03-03 17:21:07,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:21:07,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 17:21:07,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:21:07,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 17:21:07,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:21:07,880 INFO L87 Difference]: Start difference. First operand 503 states and 707 transitions. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:21:08,201 INFO L93 Difference]: Finished difference Result 901 states and 1281 transitions. [2025-03-03 17:21:08,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 17:21:08,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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 146 [2025-03-03 17:21:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:21:08,203 INFO L225 Difference]: With dead ends: 901 [2025-03-03 17:21:08,203 INFO L226 Difference]: Without dead ends: 591 [2025-03-03 17:21:08,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-03 17:21:08,204 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 611 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:21:08,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1852 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:21:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-03 17:21:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 533. [2025-03-03 17:21:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.4078947368421053) internal successors, (749), 532 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 749 transitions. [2025-03-03 17:21:08,210 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 749 transitions. Word has length 146 [2025-03-03 17:21:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:21:08,210 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 749 transitions. [2025-03-03 17:21:08,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 749 transitions. [2025-03-03 17:21:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 17:21:08,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:21:08,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:21:08,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 17:21:08,212 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:21:08,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:21:08,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1327885913, now seen corresponding path program 1 times [2025-03-03 17:21:08,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:21:08,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736725715] [2025-03-03 17:21:08,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:08,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:21:08,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 17:21:08,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 17:21:08,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:08,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 17:21:10,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:21:10,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736725715] [2025-03-03 17:21:10,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736725715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:21:10,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708632857] [2025-03-03 17:21:10,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:10,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:21:10,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:21:10,435 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:21:10,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 17:21:10,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 17:21:11,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 17:21:11,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:11,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:11,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-03 17:21:11,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:21:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:11,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:21:11,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708632857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:21:11,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:21:11,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2025-03-03 17:21:11,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955204298] [2025-03-03 17:21:11,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:21:11,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:21:11,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:21:11,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:21:11,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-03-03 17:21:11,455 INFO L87 Difference]: Start difference. First operand 533 states and 749 transitions. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:11,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:21:11,980 INFO L93 Difference]: Finished difference Result 881 states and 1248 transitions. [2025-03-03 17:21:11,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:21:11,980 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 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 146 [2025-03-03 17:21:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:21:11,981 INFO L225 Difference]: With dead ends: 881 [2025-03-03 17:21:11,981 INFO L226 Difference]: Without dead ends: 614 [2025-03-03 17:21:11,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-03-03 17:21:11,983 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 371 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:21:11,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 865 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:21:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-03-03 17:21:11,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 565. [2025-03-03 17:21:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.4095744680851063) internal successors, (795), 564 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 795 transitions. [2025-03-03 17:21:11,994 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 795 transitions. Word has length 146 [2025-03-03 17:21:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:21:11,995 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 795 transitions. [2025-03-03 17:21:11,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 795 transitions. [2025-03-03 17:21:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 17:21:11,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:21:11,996 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:21:12,007 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-03 17:21:12,196 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,SelfDestructingSolverStorable28 [2025-03-03 17:21:12,197 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:21:12,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:21:12,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1678580737, now seen corresponding path program 1 times [2025-03-03 17:21:12,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:21:12,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432820999] [2025-03-03 17:21:12,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:12,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:21:12,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 17:21:12,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 17:21:12,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:12,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:12,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:21:12,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432820999] [2025-03-03 17:21:12,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432820999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:21:12,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:21:12,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:21:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875613100] [2025-03-03 17:21:12,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:21:12,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:21:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:21:12,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:21:12,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:21:12,953 INFO L87 Difference]: Start difference. First operand 565 states and 795 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:21:13,174 INFO L93 Difference]: Finished difference Result 1056 states and 1498 transitions. [2025-03-03 17:21:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:21:13,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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 146 [2025-03-03 17:21:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:21:13,176 INFO L225 Difference]: With dead ends: 1056 [2025-03-03 17:21:13,176 INFO L226 Difference]: Without dead ends: 571 [2025-03-03 17:21:13,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:21:13,177 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 260 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:21:13,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 659 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:21:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-03 17:21:13,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2025-03-03 17:21:13,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.408450704225352) internal successors, (800), 568 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 800 transitions. [2025-03-03 17:21:13,184 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 800 transitions. Word has length 146 [2025-03-03 17:21:13,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:21:13,184 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 800 transitions. [2025-03-03 17:21:13,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 800 transitions. [2025-03-03 17:21:13,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 17:21:13,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:21:13,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:21:13,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 17:21:13,185 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:21:13,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:21:13,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1358518854, now seen corresponding path program 1 times [2025-03-03 17:21:13,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:21:13,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640079499] [2025-03-03 17:21:13,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:13,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:21:13,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 17:21:13,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 17:21:13,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:13,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:13,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:21:13,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640079499] [2025-03-03 17:21:13,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640079499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:21:13,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:21:13,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:21:13,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254596295] [2025-03-03 17:21:13,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:21:13,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:21:13,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:21:13,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:21:13,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:21:13,929 INFO L87 Difference]: Start difference. First operand 569 states and 800 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:14,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:21:14,155 INFO L93 Difference]: Finished difference Result 907 states and 1282 transitions. [2025-03-03 17:21:14,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:21:14,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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 146 [2025-03-03 17:21:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:21:14,156 INFO L225 Difference]: With dead ends: 907 [2025-03-03 17:21:14,156 INFO L226 Difference]: Without dead ends: 494 [2025-03-03 17:21:14,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:21:14,157 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 246 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:21:14,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 661 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:21:14,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-03 17:21:14,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 478. [2025-03-03 17:21:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.3962264150943395) internal successors, (666), 477 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 666 transitions. [2025-03-03 17:21:14,161 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 666 transitions. Word has length 146 [2025-03-03 17:21:14,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:21:14,162 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 666 transitions. [2025-03-03 17:21:14,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 666 transitions. [2025-03-03 17:21:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 17:21:14,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:21:14,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:21:14,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 17:21:14,163 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:21:14,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:21:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1120949937, now seen corresponding path program 1 times [2025-03-03 17:21:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:21:14,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983762118] [2025-03-03 17:21:14,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:14,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:21:14,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 17:21:14,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 17:21:14,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:14,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:16,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:21:16,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983762118] [2025-03-03 17:21:16,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983762118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:21:16,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944830009] [2025-03-03 17:21:16,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:16,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:21:16,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:21:16,245 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-03 17:21:16,246 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-03 17:21:16,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 17:21:17,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 17:21:17,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:17,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:17,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-03 17:21:17,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:21:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:17,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:21:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:18,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944830009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:21:18,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:21:18,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 35 [2025-03-03 17:21:18,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814520149] [2025-03-03 17:21:18,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:21:18,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 17:21:18,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:21:18,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 17:21:18,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 17:21:18,600 INFO L87 Difference]: Start difference. First operand 478 states and 666 transitions. Second operand has 35 states, 35 states have (on average 10.82857142857143) internal successors, (379), 35 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:21:19,876 INFO L93 Difference]: Finished difference Result 1199 states and 1689 transitions. [2025-03-03 17:21:19,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 17:21:19,876 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 10.82857142857143) internal successors, (379), 35 states have internal predecessors, (379), 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 147 [2025-03-03 17:21:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:21:19,879 INFO L225 Difference]: With dead ends: 1199 [2025-03-03 17:21:19,879 INFO L226 Difference]: Without dead ends: 897 [2025-03-03 17:21:19,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=407, Invalid=2043, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 17:21:19,881 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1159 mSDsluCounter, 2248 mSDsCounter, 0 mSdLazyCounter, 3028 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:21:19,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 2397 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3028 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 17:21:19,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2025-03-03 17:21:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 767. [2025-03-03 17:21:19,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.4046997389033942) internal successors, (1076), 766 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1076 transitions. [2025-03-03 17:21:19,892 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1076 transitions. Word has length 147 [2025-03-03 17:21:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:21:19,893 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1076 transitions. [2025-03-03 17:21:19,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.82857142857143) internal successors, (379), 35 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:19,893 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1076 transitions. [2025-03-03 17:21:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 17:21:19,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:21:19,894 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:21:19,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 17:21:20,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:21:20,095 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:21:20,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:21:20,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1733247050, now seen corresponding path program 1 times [2025-03-03 17:21:20,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:21:20,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317511951] [2025-03-03 17:21:20,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:20,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:21:20,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 17:21:20,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 17:21:20,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:20,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 17:21:22,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:21:22,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317511951] [2025-03-03 17:21:22,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317511951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:21:22,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70784813] [2025-03-03 17:21:22,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:22,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:21:22,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:21:22,680 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-03 17:21:22,681 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-03 17:21:23,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 17:21:23,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 17:21:23,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:23,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:23,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 140 conjuncts are in the unsatisfiable core [2025-03-03 17:21:23,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:21:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:24,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:21:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:26,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70784813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:21:26,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:21:26,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25, 22] total 55 [2025-03-03 17:21:26,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327610005] [2025-03-03 17:21:26,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:21:26,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-03 17:21:26,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:21:26,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-03 17:21:26,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=2633, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 17:21:26,184 INFO L87 Difference]: Start difference. First operand 767 states and 1076 transitions. Second operand has 55 states, 55 states have (on average 7.0181818181818185) internal successors, (386), 55 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:21:32,879 INFO L93 Difference]: Finished difference Result 5164 states and 7341 transitions. [2025-03-03 17:21:32,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2025-03-03 17:21:32,880 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 7.0181818181818185) internal successors, (386), 55 states have internal predecessors, (386), 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 147 [2025-03-03 17:21:32,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:21:32,888 INFO L225 Difference]: With dead ends: 5164 [2025-03-03 17:21:32,889 INFO L226 Difference]: Without dead ends: 4519 [2025-03-03 17:21:32,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10620 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2784, Invalid=29078, Unknown=0, NotChecked=0, Total=31862 [2025-03-03 17:21:32,894 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 7895 mSDsluCounter, 5460 mSDsCounter, 0 mSdLazyCounter, 8292 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7895 SdHoareTripleChecker+Valid, 5644 SdHoareTripleChecker+Invalid, 8367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 8292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:21:32,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7895 Valid, 5644 Invalid, 8367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 8292 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-03 17:21:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2025-03-03 17:21:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 1988. [2025-03-03 17:21:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1988 states, 1987 states have (on average 1.4247609461499748) internal successors, (2831), 1987 states have internal predecessors, (2831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 2831 transitions. [2025-03-03 17:21:32,923 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 2831 transitions. Word has length 147 [2025-03-03 17:21:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:21:32,923 INFO L471 AbstractCegarLoop]: Abstraction has 1988 states and 2831 transitions. [2025-03-03 17:21:32,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 7.0181818181818185) internal successors, (386), 55 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2831 transitions. [2025-03-03 17:21:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 17:21:32,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:21:32,925 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:21:32,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 17:21:33,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:21:33,126 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:21:33,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:21:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash -919062462, now seen corresponding path program 1 times [2025-03-03 17:21:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:21:33,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636061161] [2025-03-03 17:21:33,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:21:33,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 17:21:33,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 17:21:33,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:33,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:33,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:21:33,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636061161] [2025-03-03 17:21:33,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636061161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:21:33,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:21:33,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:21:33,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100142374] [2025-03-03 17:21:33,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:21:33,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:21:33,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:21:33,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:21:33,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:21:33,441 INFO L87 Difference]: Start difference. First operand 1988 states and 2831 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:21:33,600 INFO L93 Difference]: Finished difference Result 2845 states and 4067 transitions. [2025-03-03 17:21:33,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:21:33,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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 148 [2025-03-03 17:21:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:21:33,604 INFO L225 Difference]: With dead ends: 2845 [2025-03-03 17:21:33,604 INFO L226 Difference]: Without dead ends: 2008 [2025-03-03 17:21:33,605 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-03 17:21:33,605 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 294 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:21:33,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 500 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:21:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2025-03-03 17:21:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 2008. [2025-03-03 17:21:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2008 states, 2007 states have (on average 1.4205281514698556) internal successors, (2851), 2007 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 2851 transitions. [2025-03-03 17:21:33,621 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 2851 transitions. Word has length 148 [2025-03-03 17:21:33,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:21:33,622 INFO L471 AbstractCegarLoop]: Abstraction has 2008 states and 2851 transitions. [2025-03-03 17:21:33,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:21:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 2851 transitions. [2025-03-03 17:21:33,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 17:21:33,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:21:33,624 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:21:33,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 17:21:33,624 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:21:33,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:21:33,624 INFO L85 PathProgramCache]: Analyzing trace with hash 55393609, now seen corresponding path program 1 times [2025-03-03 17:21:33,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:21:33,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157480108] [2025-03-03 17:21:33,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:33,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:21:33,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 17:21:34,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 17:21:34,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:34,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:35,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:21:35,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157480108] [2025-03-03 17:21:35,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157480108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:21:35,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538056112] [2025-03-03 17:21:35,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:21:35,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:21:35,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:21:35,900 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:21:35,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 17:21:36,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 17:21:36,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 17:21:36,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:21:36,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:21:36,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 244 conjuncts are in the unsatisfiable core [2025-03-03 17:21:36,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:21:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:38,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:21:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:21:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538056112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:21:42,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:21:42,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 32, 28] total 71 [2025-03-03 17:21:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003835649] [2025-03-03 17:21:42,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:21:42,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-03 17:21:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:21:42,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-03 17:21:42,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=4458, Unknown=0, NotChecked=0, Total=4970 [2025-03-03 17:21:42,071 INFO L87 Difference]: Start difference. First operand 2008 states and 2851 transitions. Second operand has 71 states, 71 states have (on average 5.605633802816901) internal successors, (398), 71 states have internal predecessors, (398), 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)