./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.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.twocount2c.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 ae56bcfc435405d456e1dc5e8920e6da28d699f35561354769dbf7e31b8f91d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:25:31,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:25:31,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:25:31,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:25:31,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:25:31,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:25:31,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:25:31,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:25:31,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:25:31,287 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:25:31,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:25:31,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:25:31,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:25:31,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:25:31,288 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:25:31,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:25:31,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:25:31,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:25:31,289 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:25:31,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:25:31,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:25:31,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:25:31,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:25:31,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:25:31,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:25:31,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:25:31,289 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 -> ae56bcfc435405d456e1dc5e8920e6da28d699f35561354769dbf7e31b8f91d6 [2025-03-03 18:25:31,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:25:31,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:25:31,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:25:31,514 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:25:31,514 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:25:31,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2025-03-03 18:25:32,663 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4852c5a03/00a95d220c1b4673b6d6e38f7775947a/FLAG1b8095ae5 [2025-03-03 18:25:32,905 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:25:32,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2025-03-03 18:25:32,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4852c5a03/00a95d220c1b4673b6d6e38f7775947a/FLAG1b8095ae5 [2025-03-03 18:25:33,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4852c5a03/00a95d220c1b4673b6d6e38f7775947a [2025-03-03 18:25:33,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:25:33,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:25:33,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:25:33,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:25:33,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:25:33,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:25:33" (1/1) ... [2025-03-03 18:25:33,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@110c0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33, skipping insertion in model container [2025-03-03 18:25:33,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:25:33" (1/1) ... [2025-03-03 18:25:33,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:25:33,358 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.twocount2c.c[1260,1273] [2025-03-03 18:25:33,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:25:33,403 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:25:33,412 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.twocount2c.c[1260,1273] [2025-03-03 18:25:33,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:25:33,445 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:25:33,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33 WrapperNode [2025-03-03 18:25:33,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:25:33,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:25:33,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:25:33,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:25:33,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33" (1/1) ... [2025-03-03 18:25:33,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33" (1/1) ... [2025-03-03 18:25:33,484 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 166 [2025-03-03 18:25:33,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:25:33,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:25:33,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:25:33,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:25:33,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33" (1/1) ... [2025-03-03 18:25:33,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33" (1/1) ... [2025-03-03 18:25:33,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33" (1/1) ... [2025-03-03 18:25:33,510 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 18:25:33,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33" (1/1) ... [2025-03-03 18:25:33,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33" (1/1) ... [2025-03-03 18:25:33,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33" (1/1) ... [2025-03-03 18:25:33,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33" (1/1) ... [2025-03-03 18:25:33,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33" (1/1) ... [2025-03-03 18:25:33,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33" (1/1) ... [2025-03-03 18:25:33,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:25:33,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:25:33,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:25:33,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:25:33,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33" (1/1) ... [2025-03-03 18:25:33,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:25:33,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:25:33,555 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 18:25:33,557 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 18:25:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:25:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:25:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:25:33,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:25:33,618 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:25:33,620 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:25:33,865 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-03-03 18:25:33,865 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:25:33,885 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:25:33,885 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:25:33,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:25:33 BoogieIcfgContainer [2025-03-03 18:25:33,886 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:25:33,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:25:33,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:25:33,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:25:33,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:25:33" (1/3) ... [2025-03-03 18:25:33,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec212ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:25:33, skipping insertion in model container [2025-03-03 18:25:33,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:33" (2/3) ... [2025-03-03 18:25:33,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec212ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:25:33, skipping insertion in model container [2025-03-03 18:25:33,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:25:33" (3/3) ... [2025-03-03 18:25:33,895 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2c.c [2025-03-03 18:25:33,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:25:33,907 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.twocount2c.c that has 1 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:25:33,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:25:33,960 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;@4fc27715, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:25:33,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:25:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 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 18:25:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 18:25:33,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:33,969 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] [2025-03-03 18:25:33,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:33,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:33,974 INFO L85 PathProgramCache]: Analyzing trace with hash -413886595, now seen corresponding path program 1 times [2025-03-03 18:25:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:33,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831256417] [2025-03-03 18:25:33,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:33,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:34,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 18:25:34,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 18:25:34,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:34,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:34,126 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 18:25:34,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:34,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831256417] [2025-03-03 18:25:34,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831256417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:34,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:34,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:25:34,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134472031] [2025-03-03 18:25:34,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:34,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:25:34,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:34,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:25:34,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:25:34,148 INFO L87 Difference]: Start difference. First operand has 52 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 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 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 18:25:34,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:34,173 INFO L93 Difference]: Finished difference Result 91 states and 132 transitions. [2025-03-03 18:25:34,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:25:34,176 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2025-03-03 18:25:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:34,180 INFO L225 Difference]: With dead ends: 91 [2025-03-03 18:25:34,180 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 18:25:34,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:25:34,186 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:34,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:25:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 18:25:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 18:25:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 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 18:25:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-03-03 18:25:34,209 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 23 [2025-03-03 18:25:34,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:34,209 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-03-03 18:25:34,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 18:25:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-03-03 18:25:34,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 18:25:34,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:34,209 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] [2025-03-03 18:25:34,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:25:34,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:34,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1328923740, now seen corresponding path program 1 times [2025-03-03 18:25:34,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:34,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563371436] [2025-03-03 18:25:34,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:34,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:34,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 18:25:34,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 18:25:34,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:34,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:34,514 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 18:25:34,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:34,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563371436] [2025-03-03 18:25:34,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563371436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:34,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:34,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:25:34,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985656765] [2025-03-03 18:25:34,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:34,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:25:34,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:34,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:25:34,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:25:34,516 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 18:25:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:34,604 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2025-03-03 18:25:34,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:25:34,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2025-03-03 18:25:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:34,606 INFO L225 Difference]: With dead ends: 92 [2025-03-03 18:25:34,606 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 18:25:34,606 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 18:25:34,606 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 60 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:34,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 122 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:25:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 18:25:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-03-03 18:25:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 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 18:25:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2025-03-03 18:25:34,613 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 23 [2025-03-03 18:25:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:34,613 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2025-03-03 18:25:34,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 18:25:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2025-03-03 18:25:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 18:25:34,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:34,613 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] [2025-03-03 18:25:34,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:25:34,614 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:34,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:34,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1687216649, now seen corresponding path program 1 times [2025-03-03 18:25:34,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:34,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375095005] [2025-03-03 18:25:34,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:34,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 18:25:34,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 18:25:34,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:34,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:34,726 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 18:25:34,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:34,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375095005] [2025-03-03 18:25:34,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375095005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:34,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:34,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:25:34,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309350761] [2025-03-03 18:25:34,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:34,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:25:34,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:34,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:25:34,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:25:34,729 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 18:25:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:34,807 INFO L93 Difference]: Finished difference Result 119 states and 162 transitions. [2025-03-03 18:25:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:25:34,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2025-03-03 18:25:34,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:34,808 INFO L225 Difference]: With dead ends: 119 [2025-03-03 18:25:34,808 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 18:25:34,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:25:34,808 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 28 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:34,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 258 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:25:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 18:25:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2025-03-03 18:25:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 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 18:25:34,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2025-03-03 18:25:34,812 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 24 [2025-03-03 18:25:34,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:34,812 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2025-03-03 18:25:34,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 18:25:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2025-03-03 18:25:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 18:25:34,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:34,813 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] [2025-03-03 18:25:34,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:25:34,813 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:34,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash 157810994, now seen corresponding path program 1 times [2025-03-03 18:25:34,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:34,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559669143] [2025-03-03 18:25:34,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:34,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:34,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 18:25:34,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 18:25:34,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:34,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:34,928 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 18:25:34,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559669143] [2025-03-03 18:25:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559669143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:34,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:34,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:25:34,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408492318] [2025-03-03 18:25:34,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:34,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:25:34,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:34,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:25:34,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:25:34,930 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:25:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:34,969 INFO L93 Difference]: Finished difference Result 110 states and 151 transitions. [2025-03-03 18:25:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:25:34,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 18:25:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:34,970 INFO L225 Difference]: With dead ends: 110 [2025-03-03 18:25:34,970 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 18:25:34,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:25:34,971 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:34,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:25:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 18:25:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2025-03-03 18:25:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 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 18:25:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2025-03-03 18:25:34,975 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 25 [2025-03-03 18:25:34,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:34,975 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2025-03-03 18:25:34,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:25:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2025-03-03 18:25:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 18:25:34,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:34,976 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] [2025-03-03 18:25:34,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:25:34,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:34,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:34,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1970442216, now seen corresponding path program 1 times [2025-03-03 18:25:34,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:34,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000005903] [2025-03-03 18:25:34,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:34,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:34,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 18:25:35,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 18:25:35,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:35,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:35,124 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 18:25:35,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:35,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000005903] [2025-03-03 18:25:35,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000005903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:35,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:35,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:25:35,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729498701] [2025-03-03 18:25:35,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:35,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:25:35,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:35,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:25:35,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:25:35,126 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:25:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:35,152 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2025-03-03 18:25:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:25:35,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 18:25:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:35,153 INFO L225 Difference]: With dead ends: 62 [2025-03-03 18:25:35,153 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 18:25:35,153 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 18:25:35,154 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:35,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:25:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 18:25:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-03 18:25:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 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 18:25:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2025-03-03 18:25:35,157 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 25 [2025-03-03 18:25:35,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:35,157 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2025-03-03 18:25:35,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:25:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2025-03-03 18:25:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 18:25:35,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:35,158 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] [2025-03-03 18:25:35,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:25:35,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:35,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:35,159 INFO L85 PathProgramCache]: Analyzing trace with hash 958845711, now seen corresponding path program 1 times [2025-03-03 18:25:35,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:35,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307284133] [2025-03-03 18:25:35,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:35,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:35,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 18:25:35,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 18:25:35,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:35,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:35,233 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 18:25:35,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:35,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307284133] [2025-03-03 18:25:35,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307284133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:35,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:35,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:25:35,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745208251] [2025-03-03 18:25:35,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:35,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:25:35,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:35,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:25:35,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:25:35,236 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:25:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:35,266 INFO L93 Difference]: Finished difference Result 112 states and 153 transitions. [2025-03-03 18:25:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:25:35,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-03 18:25:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:35,268 INFO L225 Difference]: With dead ends: 112 [2025-03-03 18:25:35,268 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 18:25:35,268 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 18:25:35,268 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:35,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:25:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 18:25:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-03 18:25:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 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 18:25:35,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 84 transitions. [2025-03-03 18:25:35,271 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 84 transitions. Word has length 26 [2025-03-03 18:25:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:35,271 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 84 transitions. [2025-03-03 18:25:35,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:25:35,273 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2025-03-03 18:25:35,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 18:25:35,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:35,274 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] [2025-03-03 18:25:35,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:25:35,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:35,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:35,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1590955203, now seen corresponding path program 1 times [2025-03-03 18:25:35,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:35,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042121661] [2025-03-03 18:25:35,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:35,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:35,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 18:25:35,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 18:25:35,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:35,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:35,540 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 18:25:35,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:35,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042121661] [2025-03-03 18:25:35,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042121661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:35,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:35,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:25:35,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463682714] [2025-03-03 18:25:35,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:35,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:25:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:35,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:25:35,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:25:35,543 INFO L87 Difference]: Start difference. First operand 62 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:25:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:35,674 INFO L93 Difference]: Finished difference Result 152 states and 205 transitions. [2025-03-03 18:25:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:25:35,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 18:25:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:35,676 INFO L225 Difference]: With dead ends: 152 [2025-03-03 18:25:35,677 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 18:25:35,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:25:35,677 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 43 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:35,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 255 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:25:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 18:25:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2025-03-03 18:25:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 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 18:25:35,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2025-03-03 18:25:35,684 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 27 [2025-03-03 18:25:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:35,684 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2025-03-03 18:25:35,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:25:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2025-03-03 18:25:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 18:25:35,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:35,687 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 18:25:35,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:25:35,688 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:35,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:35,689 INFO L85 PathProgramCache]: Analyzing trace with hash 750184126, now seen corresponding path program 1 times [2025-03-03 18:25:35,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:35,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918365941] [2025-03-03 18:25:35,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:35,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:35,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 18:25:35,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 18:25:35,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:35,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:36,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918365941] [2025-03-03 18:25:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918365941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:25:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850740409] [2025-03-03 18:25:36,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:36,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:25:36,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:25:36,068 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 18:25:36,069 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 18:25:36,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 18:25:36,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 18:25:36,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:36,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:36,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 18:25:36,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:25:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:36,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:25:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:36,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850740409] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:25:36,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:25:36,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 22 [2025-03-03 18:25:36,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677652125] [2025-03-03 18:25:36,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:25:36,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 18:25:36,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:36,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 18:25:36,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:25:36,729 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 22 states, 22 states have (on average 5.954545454545454) internal successors, (131), 22 states have internal predecessors, (131), 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 18:25:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:37,264 INFO L93 Difference]: Finished difference Result 262 states and 349 transitions. [2025-03-03 18:25:37,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 18:25:37,265 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.954545454545454) internal successors, (131), 22 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-03 18:25:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:37,269 INFO L225 Difference]: With dead ends: 262 [2025-03-03 18:25:37,269 INFO L226 Difference]: Without dead ends: 210 [2025-03-03 18:25:37,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 18:25:37,270 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 383 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:37,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 313 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:25:37,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-03 18:25:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 96. [2025-03-03 18:25:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:25:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2025-03-03 18:25:37,283 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 50 [2025-03-03 18:25:37,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:37,283 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2025-03-03 18:25:37,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.954545454545454) internal successors, (131), 22 states have internal predecessors, (131), 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 18:25:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2025-03-03 18:25:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 18:25:37,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:37,284 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 18:25:37,306 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 18:25:37,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:25:37,488 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:37,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash 649206499, now seen corresponding path program 1 times [2025-03-03 18:25:37,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:37,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016787553] [2025-03-03 18:25:37,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:37,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:37,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 18:25:37,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 18:25:37,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:37,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016787553] [2025-03-03 18:25:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016787553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:25:37,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715850757] [2025-03-03 18:25:37,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:37,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:25:37,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:37,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:25:37,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:25:37,810 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 18:25:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:37,917 INFO L93 Difference]: Finished difference Result 243 states and 323 transitions. [2025-03-03 18:25:37,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:25:37,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 52 [2025-03-03 18:25:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:37,918 INFO L225 Difference]: With dead ends: 243 [2025-03-03 18:25:37,918 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 18:25:37,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:25:37,919 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 48 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:37,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 211 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:25:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 18:25:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 124. [2025-03-03 18:25:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.3333333333333333) internal successors, (164), 123 states have internal predecessors, (164), 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 18:25:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 164 transitions. [2025-03-03 18:25:37,925 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 164 transitions. Word has length 52 [2025-03-03 18:25:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:37,925 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 164 transitions. [2025-03-03 18:25:37,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 18:25:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 164 transitions. [2025-03-03 18:25:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 18:25:37,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:37,926 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 18:25:37,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:25:37,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:37,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:37,929 INFO L85 PathProgramCache]: Analyzing trace with hash 272599581, now seen corresponding path program 1 times [2025-03-03 18:25:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:37,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685995595] [2025-03-03 18:25:37,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:37,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:37,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 18:25:37,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 18:25:37,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:37,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 18:25:38,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:38,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685995595] [2025-03-03 18:25:38,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685995595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:38,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:38,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:25:38,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312463271] [2025-03-03 18:25:38,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:38,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:25:38,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:38,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:25:38,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:25:38,111 INFO L87 Difference]: Start difference. First operand 124 states and 164 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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 18:25:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:38,297 INFO L93 Difference]: Finished difference Result 292 states and 383 transitions. [2025-03-03 18:25:38,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:25:38,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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 53 [2025-03-03 18:25:38,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:38,299 INFO L225 Difference]: With dead ends: 292 [2025-03-03 18:25:38,299 INFO L226 Difference]: Without dead ends: 206 [2025-03-03 18:25:38,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:25:38,300 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 98 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:38,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 285 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:25:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-03 18:25:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 140. [2025-03-03 18:25:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.3597122302158273) internal successors, (189), 139 states have internal predecessors, (189), 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 18:25:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2025-03-03 18:25:38,306 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 53 [2025-03-03 18:25:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:38,306 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2025-03-03 18:25:38,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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 18:25:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2025-03-03 18:25:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 18:25:38,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:38,310 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 18:25:38,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:25:38,310 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:38,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:38,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1262358225, now seen corresponding path program 1 times [2025-03-03 18:25:38,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:38,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239492164] [2025-03-03 18:25:38,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:38,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:38,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 18:25:38,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 18:25:38,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:38,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:38,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:38,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239492164] [2025-03-03 18:25:38,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239492164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:38,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:38,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:25:38,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407461383] [2025-03-03 18:25:38,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:38,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:25:38,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:38,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:25:38,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:25:38,545 INFO L87 Difference]: Start difference. First operand 140 states and 189 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 18:25:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:38,643 INFO L93 Difference]: Finished difference Result 305 states and 404 transitions. [2025-03-03 18:25:38,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:25:38,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 53 [2025-03-03 18:25:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:38,645 INFO L225 Difference]: With dead ends: 305 [2025-03-03 18:25:38,645 INFO L226 Difference]: Without dead ends: 201 [2025-03-03 18:25:38,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:25:38,646 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:38,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 220 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:25:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-03 18:25:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 174. [2025-03-03 18:25:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.2947976878612717) internal successors, (224), 173 states have internal predecessors, (224), 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 18:25:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 224 transitions. [2025-03-03 18:25:38,650 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 224 transitions. Word has length 53 [2025-03-03 18:25:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:38,650 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 224 transitions. [2025-03-03 18:25:38,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 18:25:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 224 transitions. [2025-03-03 18:25:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 18:25:38,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:38,651 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 18:25:38,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:25:38,651 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:38,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:38,652 INFO L85 PathProgramCache]: Analyzing trace with hash -194937738, now seen corresponding path program 1 times [2025-03-03 18:25:38,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:38,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004097602] [2025-03-03 18:25:38,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:38,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:38,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 18:25:38,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 18:25:38,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:38,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:38,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:38,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004097602] [2025-03-03 18:25:38,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004097602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:38,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:38,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:25:38,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252417255] [2025-03-03 18:25:38,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:38,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:25:38,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:38,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:25:38,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:25:38,929 INFO L87 Difference]: Start difference. First operand 174 states and 224 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 18:25:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:39,003 INFO L93 Difference]: Finished difference Result 312 states and 414 transitions. [2025-03-03 18:25:39,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:25:39,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 54 [2025-03-03 18:25:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:39,005 INFO L225 Difference]: With dead ends: 312 [2025-03-03 18:25:39,005 INFO L226 Difference]: Without dead ends: 212 [2025-03-03 18:25:39,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:25:39,005 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:39,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 151 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:25:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-03 18:25:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2025-03-03 18:25:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.3014354066985645) internal successors, (272), 209 states have internal predecessors, (272), 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 18:25:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 272 transitions. [2025-03-03 18:25:39,009 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 272 transitions. Word has length 54 [2025-03-03 18:25:39,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:39,010 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 272 transitions. [2025-03-03 18:25:39,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 18:25:39,010 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 272 transitions. [2025-03-03 18:25:39,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 18:25:39,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:39,010 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 18:25:39,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 18:25:39,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:39,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:39,011 INFO L85 PathProgramCache]: Analyzing trace with hash -816844611, now seen corresponding path program 1 times [2025-03-03 18:25:39,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:39,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988211623] [2025-03-03 18:25:39,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:39,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 18:25:39,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 18:25:39,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:39,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:39,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:39,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988211623] [2025-03-03 18:25:39,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988211623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:39,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:39,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:25:39,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028176351] [2025-03-03 18:25:39,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:39,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:25:39,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:39,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:25:39,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:25:39,267 INFO L87 Difference]: Start difference. First operand 210 states and 272 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 18:25:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:39,338 INFO L93 Difference]: Finished difference Result 315 states and 416 transitions. [2025-03-03 18:25:39,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:25:39,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 55 [2025-03-03 18:25:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:39,340 INFO L225 Difference]: With dead ends: 315 [2025-03-03 18:25:39,340 INFO L226 Difference]: Without dead ends: 210 [2025-03-03 18:25:39,340 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 18:25:39,342 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:39,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 157 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:25:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-03 18:25:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-03-03 18:25:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.291866028708134) internal successors, (270), 209 states have internal predecessors, (270), 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 18:25:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 270 transitions. [2025-03-03 18:25:39,349 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 270 transitions. Word has length 55 [2025-03-03 18:25:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:39,350 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 270 transitions. [2025-03-03 18:25:39,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 18:25:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 270 transitions. [2025-03-03 18:25:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 18:25:39,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:39,351 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 18:25:39,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 18:25:39,352 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:39,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:39,352 INFO L85 PathProgramCache]: Analyzing trace with hash 998921621, now seen corresponding path program 1 times [2025-03-03 18:25:39,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:39,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003670926] [2025-03-03 18:25:39,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:39,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:39,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 18:25:39,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 18:25:39,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:39,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 18:25:39,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003670926] [2025-03-03 18:25:39,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003670926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:25:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763741719] [2025-03-03 18:25:39,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:39,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:25:39,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:25:39,666 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 18:25:39,667 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 18:25:39,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 18:25:39,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 18:25:39,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:39,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:39,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 18:25:39,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:25:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 18:25:39,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:25:39,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763741719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:39,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:25:39,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2025-03-03 18:25:39,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810614281] [2025-03-03 18:25:39,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:39,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:25:39,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:39,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:25:39,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:25:39,775 INFO L87 Difference]: Start difference. First operand 210 states and 270 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 18:25:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:39,797 INFO L93 Difference]: Finished difference Result 332 states and 433 transitions. [2025-03-03 18:25:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:25:39,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 56 [2025-03-03 18:25:39,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:39,798 INFO L225 Difference]: With dead ends: 332 [2025-03-03 18:25:39,798 INFO L226 Difference]: Without dead ends: 210 [2025-03-03 18:25:39,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:25:39,799 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:39,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:25:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-03 18:25:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-03-03 18:25:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.277511961722488) internal successors, (267), 209 states have internal predecessors, (267), 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 18:25:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 267 transitions. [2025-03-03 18:25:39,803 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 267 transitions. Word has length 56 [2025-03-03 18:25:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:39,803 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 267 transitions. [2025-03-03 18:25:39,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 18:25:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 267 transitions. [2025-03-03 18:25:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 18:25:39,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:39,803 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 18:25:39,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 18:25:40,007 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,SelfDestructingSolverStorable13 [2025-03-03 18:25:40,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:40,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:40,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1967847655, now seen corresponding path program 1 times [2025-03-03 18:25:40,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:40,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879279785] [2025-03-03 18:25:40,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:40,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:40,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 18:25:40,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 18:25:40,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:40,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 18:25:40,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:40,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879279785] [2025-03-03 18:25:40,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879279785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:40,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:40,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:25:40,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71286556] [2025-03-03 18:25:40,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:40,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:25:40,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:40,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:25:40,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:25:40,237 INFO L87 Difference]: Start difference. First operand 210 states and 267 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 18:25:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:40,399 INFO L93 Difference]: Finished difference Result 419 states and 528 transitions. [2025-03-03 18:25:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:25:40,399 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 56 [2025-03-03 18:25:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:40,400 INFO L225 Difference]: With dead ends: 419 [2025-03-03 18:25:40,400 INFO L226 Difference]: Without dead ends: 297 [2025-03-03 18:25:40,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:25:40,401 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 106 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:40,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 240 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:25:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-03 18:25:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 216. [2025-03-03 18:25:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.2697674418604652) internal successors, (273), 215 states have internal predecessors, (273), 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 18:25:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 273 transitions. [2025-03-03 18:25:40,407 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 273 transitions. Word has length 56 [2025-03-03 18:25:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:40,407 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 273 transitions. [2025-03-03 18:25:40,407 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 18:25:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 273 transitions. [2025-03-03 18:25:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:25:40,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:40,410 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 18:25:40,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 18:25:40,411 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:40,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1437359841, now seen corresponding path program 1 times [2025-03-03 18:25:40,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:40,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811578350] [2025-03-03 18:25:40,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:40,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:40,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:25:40,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:25:40,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:40,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 18:25:40,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:40,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811578350] [2025-03-03 18:25:40,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811578350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:40,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:40,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:25:40,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545760273] [2025-03-03 18:25:40,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:40,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:25:40,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:40,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:25:40,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:25:40,625 INFO L87 Difference]: Start difference. First operand 216 states and 273 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 18:25:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:40,744 INFO L93 Difference]: Finished difference Result 338 states and 434 transitions. [2025-03-03 18:25:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:25:40,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 57 [2025-03-03 18:25:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:40,746 INFO L225 Difference]: With dead ends: 338 [2025-03-03 18:25:40,746 INFO L226 Difference]: Without dead ends: 216 [2025-03-03 18:25:40,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:25:40,746 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 82 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:40,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 186 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:25:40,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-03 18:25:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 195. [2025-03-03 18:25:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.2525773195876289) internal successors, (243), 194 states have internal predecessors, (243), 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 18:25:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 243 transitions. [2025-03-03 18:25:40,756 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 243 transitions. Word has length 57 [2025-03-03 18:25:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:40,756 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 243 transitions. [2025-03-03 18:25:40,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 18:25:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 243 transitions. [2025-03-03 18:25:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:25:40,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:40,757 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 18:25:40,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 18:25:40,757 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:40,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2142518254, now seen corresponding path program 1 times [2025-03-03 18:25:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:40,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379910572] [2025-03-03 18:25:40,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:40,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:40,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:25:40,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:25:40,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:40,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:41,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:41,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379910572] [2025-03-03 18:25:41,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379910572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:41,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:41,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:25:41,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012044745] [2025-03-03 18:25:41,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:41,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:25:41,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:41,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:25:41,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:25:41,130 INFO L87 Difference]: Start difference. First operand 195 states and 243 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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 18:25:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:41,315 INFO L93 Difference]: Finished difference Result 308 states and 390 transitions. [2025-03-03 18:25:41,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:25:41,316 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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 57 [2025-03-03 18:25:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:41,317 INFO L225 Difference]: With dead ends: 308 [2025-03-03 18:25:41,317 INFO L226 Difference]: Without dead ends: 213 [2025-03-03 18:25:41,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:25:41,317 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 90 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:41,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 313 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:25:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-03 18:25:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 197. [2025-03-03 18:25:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.2551020408163265) internal successors, (246), 196 states have internal predecessors, (246), 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 18:25:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 246 transitions. [2025-03-03 18:25:41,327 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 246 transitions. Word has length 57 [2025-03-03 18:25:41,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:41,328 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 246 transitions. [2025-03-03 18:25:41,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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 18:25:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 246 transitions. [2025-03-03 18:25:41,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:25:41,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:41,329 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 18:25:41,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 18:25:41,329 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:41,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:41,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1709773296, now seen corresponding path program 1 times [2025-03-03 18:25:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:41,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965293654] [2025-03-03 18:25:41,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:41,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:41,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:25:41,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:25:41,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:41,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:41,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:41,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965293654] [2025-03-03 18:25:41,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965293654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:25:41,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069012645] [2025-03-03 18:25:41,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:41,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:25:41,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:25:41,843 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 18:25:41,844 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 18:25:41,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:25:41,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:25:41,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:41,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:41,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-03 18:25:41,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:25:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:42,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:25:43,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:43,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069012645] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:25:43,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:25:43,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 16] total 37 [2025-03-03 18:25:43,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824710550] [2025-03-03 18:25:43,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:25:43,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 18:25:43,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:43,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 18:25:43,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1191, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 18:25:43,326 INFO L87 Difference]: Start difference. First operand 197 states and 246 transitions. Second operand has 37 states, 37 states have (on average 4.297297297297297) internal successors, (159), 37 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:25:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:46,051 INFO L93 Difference]: Finished difference Result 685 states and 848 transitions. [2025-03-03 18:25:46,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-03 18:25:46,052 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.297297297297297) internal successors, (159), 37 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-03 18:25:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:46,053 INFO L225 Difference]: With dead ends: 685 [2025-03-03 18:25:46,053 INFO L226 Difference]: Without dead ends: 590 [2025-03-03 18:25:46,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2557 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1139, Invalid=8563, Unknown=0, NotChecked=0, Total=9702 [2025-03-03 18:25:46,057 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 479 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:46,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 578 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:25:46,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-03 18:25:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 262. [2025-03-03 18:25:46,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.21455938697318) internal successors, (317), 261 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 18:25:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 317 transitions. [2025-03-03 18:25:46,070 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 317 transitions. Word has length 57 [2025-03-03 18:25:46,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:46,071 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 317 transitions. [2025-03-03 18:25:46,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.297297297297297) internal successors, (159), 37 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:25:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 317 transitions. [2025-03-03 18:25:46,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 18:25:46,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:46,072 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 18:25:46,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 18:25:46,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 18:25:46,272 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:46,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:46,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1049712839, now seen corresponding path program 1 times [2025-03-03 18:25:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693840131] [2025-03-03 18:25:46,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:46,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:46,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 18:25:46,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 18:25:46,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:46,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:46,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:46,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693840131] [2025-03-03 18:25:46,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693840131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:46,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:25:46,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:25:46,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684519837] [2025-03-03 18:25:46,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:46,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:25:46,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:46,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:25:46,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:25:46,554 INFO L87 Difference]: Start difference. First operand 262 states and 317 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 18:25:46,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:46,684 INFO L93 Difference]: Finished difference Result 459 states and 567 transitions. [2025-03-03 18:25:46,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:25:46,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 76 [2025-03-03 18:25:46,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:46,686 INFO L225 Difference]: With dead ends: 459 [2025-03-03 18:25:46,686 INFO L226 Difference]: Without dead ends: 369 [2025-03-03 18:25:46,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:25:46,686 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 77 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:46,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 301 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:25:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-03 18:25:46,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 295. [2025-03-03 18:25:46,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.2210884353741496) internal successors, (359), 294 states have internal predecessors, (359), 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 18:25:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 359 transitions. [2025-03-03 18:25:46,695 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 359 transitions. Word has length 76 [2025-03-03 18:25:46,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:46,695 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 359 transitions. [2025-03-03 18:25:46,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 18:25:46,695 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 359 transitions. [2025-03-03 18:25:46,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 18:25:46,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:46,697 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 18:25:46,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 18:25:46,697 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:46,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash 792430730, now seen corresponding path program 1 times [2025-03-03 18:25:46,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:46,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770801422] [2025-03-03 18:25:46,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:46,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:46,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 18:25:46,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 18:25:46,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:46,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:47,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:47,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770801422] [2025-03-03 18:25:47,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770801422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:25:47,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057578749] [2025-03-03 18:25:47,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:47,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:25:47,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:25:47,195 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 18:25:47,195 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 18:25:47,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 18:25:47,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 18:25:47,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:47,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:47,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-03 18:25:47,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:25:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 37 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:25:47,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:25:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 35 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:48,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057578749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:25:48,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:25:48,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 31 [2025-03-03 18:25:48,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633222015] [2025-03-03 18:25:48,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:25:48,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 18:25:48,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:48,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 18:25:48,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2025-03-03 18:25:48,278 INFO L87 Difference]: Start difference. First operand 295 states and 359 transitions. Second operand has 31 states, 31 states have (on average 6.064516129032258) internal successors, (188), 31 states have internal predecessors, (188), 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 18:25:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:50,085 INFO L93 Difference]: Finished difference Result 1108 states and 1342 transitions. [2025-03-03 18:25:50,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-03 18:25:50,086 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.064516129032258) internal successors, (188), 31 states have internal predecessors, (188), 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 78 [2025-03-03 18:25:50,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:50,089 INFO L225 Difference]: With dead ends: 1108 [2025-03-03 18:25:50,089 INFO L226 Difference]: Without dead ends: 962 [2025-03-03 18:25:50,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1787 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1019, Invalid=5953, Unknown=0, NotChecked=0, Total=6972 [2025-03-03 18:25:50,092 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 759 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:50,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 504 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:25:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-03-03 18:25:50,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 620. [2025-03-03 18:25:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.2310177705977383) internal successors, (762), 619 states have internal predecessors, (762), 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 18:25:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 762 transitions. [2025-03-03 18:25:50,108 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 762 transitions. Word has length 78 [2025-03-03 18:25:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:50,108 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 762 transitions. [2025-03-03 18:25:50,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.064516129032258) internal successors, (188), 31 states have internal predecessors, (188), 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 18:25:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 762 transitions. [2025-03-03 18:25:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 18:25:50,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:50,109 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 18:25:50,116 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 18:25:50,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:25:50,310 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:50,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:50,310 INFO L85 PathProgramCache]: Analyzing trace with hash 544131303, now seen corresponding path program 1 times [2025-03-03 18:25:50,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:50,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105988366] [2025-03-03 18:25:50,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:50,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:50,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 18:25:50,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 18:25:50,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:50,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:50,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:50,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105988366] [2025-03-03 18:25:50,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105988366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:25:50,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629562711] [2025-03-03 18:25:50,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:50,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:25:50,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:25:50,637 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 18:25:50,639 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 18:25:50,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 18:25:50,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 18:25:50,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:50,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:50,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 18:25:50,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:25:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:51,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:25:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 39 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:51,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629562711] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:25:51,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:25:51,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 26 [2025-03-03 18:25:51,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094750963] [2025-03-03 18:25:51,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:25:51,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 18:25:51,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:51,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 18:25:51,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2025-03-03 18:25:51,414 INFO L87 Difference]: Start difference. First operand 620 states and 762 transitions. Second operand has 26 states, 26 states have (on average 7.038461538461538) internal successors, (183), 26 states have internal predecessors, (183), 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 18:25:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:51,939 INFO L93 Difference]: Finished difference Result 1537 states and 1892 transitions. [2025-03-03 18:25:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 18:25:51,940 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.038461538461538) internal successors, (183), 26 states have internal predecessors, (183), 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 79 [2025-03-03 18:25:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:51,943 INFO L225 Difference]: With dead ends: 1537 [2025-03-03 18:25:51,943 INFO L226 Difference]: Without dead ends: 1201 [2025-03-03 18:25:51,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=293, Invalid=1189, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 18:25:51,944 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 240 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:51,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1035 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:25:51,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2025-03-03 18:25:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 974. [2025-03-03 18:25:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 973 states have (on average 1.224049331963001) internal successors, (1191), 973 states have internal predecessors, (1191), 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 18:25:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1191 transitions. [2025-03-03 18:25:51,962 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1191 transitions. Word has length 79 [2025-03-03 18:25:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:51,962 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1191 transitions. [2025-03-03 18:25:51,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.038461538461538) internal successors, (183), 26 states have internal predecessors, (183), 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 18:25:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1191 transitions. [2025-03-03 18:25:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 18:25:51,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:51,964 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 18:25:51,970 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 18:25:52,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:25:52,168 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:52,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:52,168 INFO L85 PathProgramCache]: Analyzing trace with hash 239501995, now seen corresponding path program 1 times [2025-03-03 18:25:52,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:52,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435589962] [2025-03-03 18:25:52,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:52,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:52,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 18:25:52,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 18:25:52,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:52,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:52,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435589962] [2025-03-03 18:25:52,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435589962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:25:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414135156] [2025-03-03 18:25:52,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:52,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:25:52,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:25:52,750 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 18:25:52,751 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 18:25:52,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 18:25:52,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 18:25:52,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:52,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:52,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-03-03 18:25:52,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:25:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 27 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:53,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:25:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:25:54,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414135156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:25:54,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:25:54,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 20] total 44 [2025-03-03 18:25:54,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144449016] [2025-03-03 18:25:54,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:25:54,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 18:25:54,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:54,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 18:25:54,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 18:25:54,946 INFO L87 Difference]: Start difference. First operand 974 states and 1191 transitions. Second operand has 44 states, 44 states have (on average 5.181818181818182) internal successors, (228), 44 states have internal predecessors, (228), 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 18:25:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:59,533 INFO L93 Difference]: Finished difference Result 3117 states and 3794 transitions. [2025-03-03 18:25:59,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2025-03-03 18:25:59,536 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 5.181818181818182) internal successors, (228), 44 states have internal predecessors, (228), 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 80 [2025-03-03 18:25:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:59,542 INFO L225 Difference]: With dead ends: 3117 [2025-03-03 18:25:59,542 INFO L226 Difference]: Without dead ends: 2503 [2025-03-03 18:25:59,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10317 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3386, Invalid=26026, Unknown=0, NotChecked=0, Total=29412 [2025-03-03 18:25:59,550 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1347 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:59,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 476 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:25:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2025-03-03 18:25:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 875. [2025-03-03 18:25:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 874 states have (on average 1.2540045766590389) internal successors, (1096), 874 states have internal predecessors, (1096), 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 18:25:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1096 transitions. [2025-03-03 18:25:59,578 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1096 transitions. Word has length 80 [2025-03-03 18:25:59,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:59,578 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1096 transitions. [2025-03-03 18:25:59,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.181818181818182) internal successors, (228), 44 states have internal predecessors, (228), 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 18:25:59,578 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1096 transitions. [2025-03-03 18:25:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 18:25:59,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:59,581 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 18:25:59,589 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 18:25:59,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:25:59,786 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:59,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:59,787 INFO L85 PathProgramCache]: Analyzing trace with hash -400135167, now seen corresponding path program 1 times [2025-03-03 18:25:59,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:59,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996730888] [2025-03-03 18:25:59,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:59,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 18:25:59,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 18:25:59,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:59,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 18:26:00,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:00,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996730888] [2025-03-03 18:26:00,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996730888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:00,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:00,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:26:00,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752724541] [2025-03-03 18:26:00,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:00,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:26:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:00,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:26:00,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:26:00,242 INFO L87 Difference]: Start difference. First operand 875 states and 1096 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 18:26:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:00,376 INFO L93 Difference]: Finished difference Result 1858 states and 2299 transitions. [2025-03-03 18:26:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:26:00,376 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 83 [2025-03-03 18:26:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:00,379 INFO L225 Difference]: With dead ends: 1858 [2025-03-03 18:26:00,379 INFO L226 Difference]: Without dead ends: 1023 [2025-03-03 18:26:00,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:26:00,380 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 39 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:00,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 362 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:26:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-03-03 18:26:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 895. [2025-03-03 18:26:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 1.2527964205816555) internal successors, (1120), 894 states have internal predecessors, (1120), 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 18:26:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1120 transitions. [2025-03-03 18:26:00,395 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1120 transitions. Word has length 83 [2025-03-03 18:26:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:00,396 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1120 transitions. [2025-03-03 18:26:00,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 18:26:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1120 transitions. [2025-03-03 18:26:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 18:26:00,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:00,397 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 18:26:00,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 18:26:00,397 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:00,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:00,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2045423230, now seen corresponding path program 1 times [2025-03-03 18:26:00,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:00,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602172606] [2025-03-03 18:26:00,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:00,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:00,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 18:26:00,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 18:26:00,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:00,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 18:26:00,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:00,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602172606] [2025-03-03 18:26:00,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602172606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:00,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:00,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:26:00,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801932763] [2025-03-03 18:26:00,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:00,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:26:00,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:00,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:26:00,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:26:00,647 INFO L87 Difference]: Start difference. First operand 895 states and 1120 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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 18:26:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:00,725 INFO L93 Difference]: Finished difference Result 1897 states and 2338 transitions. [2025-03-03 18:26:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:26:00,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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 104 [2025-03-03 18:26:00,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:00,728 INFO L225 Difference]: With dead ends: 1897 [2025-03-03 18:26:00,728 INFO L226 Difference]: Without dead ends: 1062 [2025-03-03 18:26:00,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:26:00,730 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 36 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:00,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 392 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:26:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-03-03 18:26:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 889. [2025-03-03 18:26:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 1.2522522522522523) internal successors, (1112), 888 states have internal predecessors, (1112), 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 18:26:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1112 transitions. [2025-03-03 18:26:00,746 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1112 transitions. Word has length 104 [2025-03-03 18:26:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:00,746 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1112 transitions. [2025-03-03 18:26:00,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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 18:26:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1112 transitions. [2025-03-03 18:26:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 18:26:00,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:00,749 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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 18:26:00,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 18:26:00,749 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:00,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:00,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1603075262, now seen corresponding path program 1 times [2025-03-03 18:26:00,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:00,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706724323] [2025-03-03 18:26:00,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:00,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:00,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 18:26:00,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 18:26:00,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:00,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 81 proven. 44 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 18:26:01,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:01,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706724323] [2025-03-03 18:26:01,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706724323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:26:01,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111352429] [2025-03-03 18:26:01,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:01,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:26:01,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:26:01,356 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 18:26:01,357 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 18:26:01,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 18:26:01,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 18:26:01,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:01,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:01,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-03-03 18:26:01,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:26:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 84 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:26:02,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:26:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 62 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:26:03,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111352429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:26:03,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:26:03,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 18] total 45 [2025-03-03 18:26:03,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600192437] [2025-03-03 18:26:03,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:26:03,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-03 18:26:03,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:03,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-03 18:26:03,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 18:26:03,141 INFO L87 Difference]: Start difference. First operand 889 states and 1112 transitions. Second operand has 45 states, 45 states have (on average 5.822222222222222) internal successors, (262), 45 states have internal predecessors, (262), 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 18:26:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:06,963 INFO L93 Difference]: Finished difference Result 3726 states and 4515 transitions. [2025-03-03 18:26:06,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-03 18:26:06,963 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 5.822222222222222) internal successors, (262), 45 states have internal predecessors, (262), 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 105 [2025-03-03 18:26:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:06,969 INFO L225 Difference]: With dead ends: 3726 [2025-03-03 18:26:06,969 INFO L226 Difference]: Without dead ends: 2877 [2025-03-03 18:26:06,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9609 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3990, Invalid=25422, Unknown=0, NotChecked=0, Total=29412 [2025-03-03 18:26:06,975 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 1641 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1641 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:06,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1641 Valid, 1361 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:26:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2025-03-03 18:26:06,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1197. [2025-03-03 18:26:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1196 states have (on average 1.2533444816053512) internal successors, (1499), 1196 states have internal predecessors, (1499), 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 18:26:07,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1499 transitions. [2025-03-03 18:26:07,003 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1499 transitions. Word has length 105 [2025-03-03 18:26:07,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:07,004 INFO L471 AbstractCegarLoop]: Abstraction has 1197 states and 1499 transitions. [2025-03-03 18:26:07,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 5.822222222222222) internal successors, (262), 45 states have internal predecessors, (262), 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 18:26:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1499 transitions. [2025-03-03 18:26:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 18:26:07,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:07,006 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:07,014 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 18:26:07,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:26:07,207 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:07,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:07,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1874911331, now seen corresponding path program 1 times [2025-03-03 18:26:07,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:07,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143526622] [2025-03-03 18:26:07,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:07,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:07,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 18:26:07,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 18:26:07,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:07,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 18:26:07,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:07,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143526622] [2025-03-03 18:26:07,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143526622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:26:07,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256159227] [2025-03-03 18:26:07,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:07,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:26:07,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:26:07,865 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 18:26:07,866 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 18:26:07,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 18:26:08,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 18:26:08,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:08,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:08,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-03-03 18:26:08,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:26:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 87 proven. 23 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 18:26:08,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:26:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 61 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:26:10,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256159227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:26:10,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:26:10,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 23] total 44 [2025-03-03 18:26:10,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327843485] [2025-03-03 18:26:10,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:26:10,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 18:26:10,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:10,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 18:26:10,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1659, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 18:26:10,374 INFO L87 Difference]: Start difference. First operand 1197 states and 1499 transitions. Second operand has 44 states, 44 states have (on average 5.7727272727272725) internal successors, (254), 44 states have internal predecessors, (254), 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 18:26:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:11,310 INFO L93 Difference]: Finished difference Result 3386 states and 4158 transitions. [2025-03-03 18:26:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-03 18:26:11,311 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 5.7727272727272725) internal successors, (254), 44 states have internal predecessors, (254), 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 107 [2025-03-03 18:26:11,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:11,316 INFO L225 Difference]: With dead ends: 3386 [2025-03-03 18:26:11,316 INFO L226 Difference]: Without dead ends: 2229 [2025-03-03 18:26:11,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=497, Invalid=3409, Unknown=0, NotChecked=0, Total=3906 [2025-03-03 18:26:11,318 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 264 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:11,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 409 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:26:11,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2025-03-03 18:26:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 1429. [2025-03-03 18:26:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1428 states have (on average 1.245798319327731) internal successors, (1779), 1428 states have internal predecessors, (1779), 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 18:26:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1779 transitions. [2025-03-03 18:26:11,347 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1779 transitions. Word has length 107 [2025-03-03 18:26:11,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:11,347 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 1779 transitions. [2025-03-03 18:26:11,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.7727272727272725) internal successors, (254), 44 states have internal predecessors, (254), 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 18:26:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1779 transitions. [2025-03-03 18:26:11,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 18:26:11,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:11,350 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 18:26:11,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 18:26:11,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 18:26:11,555 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:11,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:11,555 INFO L85 PathProgramCache]: Analyzing trace with hash 825238759, now seen corresponding path program 1 times [2025-03-03 18:26:11,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:11,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326290302] [2025-03-03 18:26:11,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:11,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:11,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 18:26:11,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 18:26:11,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:11,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 118 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:26:12,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326290302] [2025-03-03 18:26:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326290302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:26:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847428022] [2025-03-03 18:26:12,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:12,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:26:12,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:26:12,623 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:26:12,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 18:26:12,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 18:26:12,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 18:26:12,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:12,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:12,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-03 18:26:12,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:26:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 63 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:26:13,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:26:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 50 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:26:14,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847428022] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:26:14,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:26:14,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 19] total 52 [2025-03-03 18:26:14,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450587904] [2025-03-03 18:26:14,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:26:14,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-03 18:26:14,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:14,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-03 18:26:14,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2420, Unknown=0, NotChecked=0, Total=2652 [2025-03-03 18:26:14,726 INFO L87 Difference]: Start difference. First operand 1429 states and 1779 transitions. Second operand has 52 states, 52 states have (on average 5.865384615384615) internal successors, (305), 52 states have internal predecessors, (305), 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 18:26:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:33,415 INFO L93 Difference]: Finished difference Result 8512 states and 10193 transitions. [2025-03-03 18:26:33,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 468 states. [2025-03-03 18:26:33,415 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 5.865384615384615) internal successors, (305), 52 states have internal predecessors, (305), 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 108 [2025-03-03 18:26:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:33,429 INFO L225 Difference]: With dead ends: 8512 [2025-03-03 18:26:33,429 INFO L226 Difference]: Without dead ends: 7228 [2025-03-03 18:26:33,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 511 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112411 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=15680, Invalid=246976, Unknown=0, NotChecked=0, Total=262656 [2025-03-03 18:26:33,442 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 2548 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 5208 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2548 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 5291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 5208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:33,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2548 Valid, 1641 Invalid, 5291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 5208 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 18:26:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7228 states. [2025-03-03 18:26:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7228 to 2937. [2025-03-03 18:26:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2937 states, 2936 states have (on average 1.2510217983651226) internal successors, (3673), 2936 states have internal predecessors, (3673), 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 18:26:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 3673 transitions. [2025-03-03 18:26:33,507 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 3673 transitions. Word has length 108 [2025-03-03 18:26:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:33,507 INFO L471 AbstractCegarLoop]: Abstraction has 2937 states and 3673 transitions. [2025-03-03 18:26:33,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.865384615384615) internal successors, (305), 52 states have internal predecessors, (305), 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 18:26:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 3673 transitions. [2025-03-03 18:26:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 18:26:33,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:33,512 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 18:26:33,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 18:26:33,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 18:26:33,713 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:33,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:33,713 INFO L85 PathProgramCache]: Analyzing trace with hash 808308206, now seen corresponding path program 1 times [2025-03-03 18:26:33,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:33,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706230985] [2025-03-03 18:26:33,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:33,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:33,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 18:26:33,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 18:26:33,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:33,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 55 proven. 50 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 18:26:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:34,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706230985] [2025-03-03 18:26:34,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706230985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:26:34,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359063952] [2025-03-03 18:26:34,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:34,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:26:34,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:26:34,306 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:26:34,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 18:26:34,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 18:26:34,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 18:26:34,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:34,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:34,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-03 18:26:34,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:26:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 22 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:26:35,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:26:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 114 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 18:26:38,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359063952] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:26:38,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:26:38,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23, 22] total 54 [2025-03-03 18:26:38,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140530109] [2025-03-03 18:26:38,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:26:38,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-03 18:26:38,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:38,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-03 18:26:38,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2556, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 18:26:38,853 INFO L87 Difference]: Start difference. First operand 2937 states and 3673 transitions. Second operand has 54 states, 54 states have (on average 5.407407407407407) internal successors, (292), 54 states have internal predecessors, (292), 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 18:26:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:41,719 INFO L93 Difference]: Finished difference Result 6702 states and 8200 transitions. [2025-03-03 18:26:41,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-03-03 18:26:41,719 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.407407407407407) internal successors, (292), 54 states have internal predecessors, (292), 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 109 [2025-03-03 18:26:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:41,728 INFO L225 Difference]: With dead ends: 6702 [2025-03-03 18:26:41,728 INFO L226 Difference]: Without dead ends: 4267 [2025-03-03 18:26:41,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5536 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2276, Invalid=15546, Unknown=0, NotChecked=0, Total=17822 [2025-03-03 18:26:41,732 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1086 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:41,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 596 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:26:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2025-03-03 18:26:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 2066. [2025-03-03 18:26:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 2065 states have (on average 1.2440677966101694) internal successors, (2569), 2065 states have internal predecessors, (2569), 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 18:26:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 2569 transitions. [2025-03-03 18:26:41,770 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 2569 transitions. Word has length 109 [2025-03-03 18:26:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:41,770 INFO L471 AbstractCegarLoop]: Abstraction has 2066 states and 2569 transitions. [2025-03-03 18:26:41,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.407407407407407) internal successors, (292), 54 states have internal predecessors, (292), 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 18:26:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2569 transitions. [2025-03-03 18:26:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 18:26:41,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:41,773 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 18:26:41,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 18:26:41,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 18:26:41,974 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:41,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash -571580437, now seen corresponding path program 1 times [2025-03-03 18:26:41,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:41,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357866932] [2025-03-03 18:26:41,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:41,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:41,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 18:26:42,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 18:26:42,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:42,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 62 proven. 72 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 18:26:42,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:42,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357866932] [2025-03-03 18:26:42,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357866932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:26:42,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751307320] [2025-03-03 18:26:42,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:42,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:26:42,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:26:42,969 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:26:42,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 18:26:43,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 18:26:43,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 18:26:43,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:43,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:43,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-03-03 18:26:43,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:26:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 62 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:26:44,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:26:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 70 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:26:46,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751307320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:26:46,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:26:46,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27, 30] total 71 [2025-03-03 18:26:46,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66242060] [2025-03-03 18:26:46,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:26:46,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-03 18:26:46,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:46,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-03 18:26:46,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=587, Invalid=4383, Unknown=0, NotChecked=0, Total=4970 [2025-03-03 18:26:46,764 INFO L87 Difference]: Start difference. First operand 2066 states and 2569 transitions. Second operand has 71 states, 71 states have (on average 4.028169014084507) internal successors, (286), 71 states have internal predecessors, (286), 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 18:26:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:51,556 INFO L93 Difference]: Finished difference Result 11184 states and 13306 transitions. [2025-03-03 18:26:51,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2025-03-03 18:26:51,556 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 4.028169014084507) internal successors, (286), 71 states have internal predecessors, (286), 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 113 [2025-03-03 18:26:51,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:51,574 INFO L225 Difference]: With dead ends: 11184 [2025-03-03 18:26:51,574 INFO L226 Difference]: Without dead ends: 9528 [2025-03-03 18:26:51,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8545 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3106, Invalid=19244, Unknown=0, NotChecked=0, Total=22350 [2025-03-03 18:26:51,579 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1219 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 3209 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 3267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:51,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 1947 Invalid, 3267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3209 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 18:26:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9528 states. [2025-03-03 18:26:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9528 to 2960. [2025-03-03 18:26:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2960 states, 2959 states have (on average 1.2446772558296721) internal successors, (3683), 2959 states have internal predecessors, (3683), 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 18:26:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2960 states and 3683 transitions. [2025-03-03 18:26:51,641 INFO L78 Accepts]: Start accepts. Automaton has 2960 states and 3683 transitions. Word has length 113 [2025-03-03 18:26:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:51,641 INFO L471 AbstractCegarLoop]: Abstraction has 2960 states and 3683 transitions. [2025-03-03 18:26:51,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 4.028169014084507) internal successors, (286), 71 states have internal predecessors, (286), 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 18:26:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 3683 transitions. [2025-03-03 18:26:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 18:26:51,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:51,644 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 18:26:51,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 18:26:51,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 18:26:51,845 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:51,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:51,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1014130473, now seen corresponding path program 1 times [2025-03-03 18:26:51,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:51,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567409592] [2025-03-03 18:26:51,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:51,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:51,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 18:26:51,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 18:26:51,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:51,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 65 proven. 62 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 18:26:53,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:53,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567409592] [2025-03-03 18:26:53,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567409592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:26:53,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748146454] [2025-03-03 18:26:53,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:53,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:26:53,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:26:53,111 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:26:53,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 18:26:53,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 18:26:53,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 18:26:53,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:53,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:53,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 155 conjuncts are in the unsatisfiable core [2025-03-03 18:26:53,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:26:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 62 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:26:54,938 INFO L312 TraceCheckSpWp]: Computing backward predicates...