./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 92be10af768295be2ee9c176bac2a7de85c1afeb202e4b441d20022190d8e93f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:50:51,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:50:51,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:50:51,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:50:51,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:50:51,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:50:51,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:50:51,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:50:51,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:50:51,244 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:50:51,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:50:51,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:50:51,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:50:51,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:50:51,245 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:50:51,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:50:51,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:50:51,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:50:51,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:50:51,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:50:51,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:50:51,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:50:51,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:50:51,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:50:51,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:50:51,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:50:51,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:50:51,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:50:51,246 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:50:51,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:50:51,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:50:51,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:50:51,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:50:51,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:50:51,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:50:51,247 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:50:51,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:50:51,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:50:51,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:50:51,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:50:51,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:50:51,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:50:51,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:50:51,248 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 92be10af768295be2ee9c176bac2a7de85c1afeb202e4b441d20022190d8e93f [2025-03-03 14:50:51,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:50:51,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:50:51,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:50:51,466 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:50:51,466 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:50:51,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c [2025-03-03 14:50:52,574 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6c4c4f8/41a21e03e23a4463a86ccb33eee299e3/FLAG687880963 [2025-03-03 14:50:52,784 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:50:52,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c [2025-03-03 14:50:52,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6c4c4f8/41a21e03e23a4463a86ccb33eee299e3/FLAG687880963 [2025-03-03 14:50:52,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6c4c4f8/41a21e03e23a4463a86ccb33eee299e3 [2025-03-03 14:50:52,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:50:52,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:50:52,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:50:52,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:50:52,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:50:52,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:50:52" (1/1) ... [2025-03-03 14:50:52,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154be36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52, skipping insertion in model container [2025-03-03 14:50:52,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:50:52" (1/1) ... [2025-03-03 14:50:52,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:50:52,949 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/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c[6043,6056] [2025-03-03 14:50:52,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:50:52,960 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:50:52,982 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/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c[6043,6056] [2025-03-03 14:50:52,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:50:52,993 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:50:52,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52 WrapperNode [2025-03-03 14:50:52,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:50:52,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:50:52,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:50:52,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:50:52,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52" (1/1) ... [2025-03-03 14:50:53,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52" (1/1) ... [2025-03-03 14:50:53,017 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 219 [2025-03-03 14:50:53,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:50:53,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:50:53,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:50:53,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:50:53,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52" (1/1) ... [2025-03-03 14:50:53,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52" (1/1) ... [2025-03-03 14:50:53,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52" (1/1) ... [2025-03-03 14:50:53,034 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 14:50:53,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52" (1/1) ... [2025-03-03 14:50:53,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52" (1/1) ... [2025-03-03 14:50:53,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52" (1/1) ... [2025-03-03 14:50:53,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52" (1/1) ... [2025-03-03 14:50:53,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52" (1/1) ... [2025-03-03 14:50:53,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52" (1/1) ... [2025-03-03 14:50:53,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:50:53,041 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:50:53,041 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:50:53,041 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:50:53,042 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52" (1/1) ... [2025-03-03 14:50:53,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:50:53,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:50:53,068 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 14:50:53,071 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 14:50:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:50:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:50:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:50:53,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:50:53,145 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:50:53,146 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:50:53,370 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-03 14:50:53,370 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:50:53,383 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:50:53,383 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:50:53,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:50:53 BoogieIcfgContainer [2025-03-03 14:50:53,383 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:50:53,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:50:53,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:50:53,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:50:53,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:50:52" (1/3) ... [2025-03-03 14:50:53,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e913e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:50:53, skipping insertion in model container [2025-03-03 14:50:53,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:52" (2/3) ... [2025-03-03 14:50:53,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e913e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:50:53, skipping insertion in model container [2025-03-03 14:50:53,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:50:53" (3/3) ... [2025-03-03 14:50:53,393 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c [2025-03-03 14:50:53,403 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:50:53,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c that has 1 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:50:53,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:50:53,455 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;@264b48c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:50:53,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:50:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 55 states have (on average 1.690909090909091) internal successors, (93), 56 states have internal predecessors, (93), 0 states have call successors, (0), 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 14:50:53,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 14:50:53,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:53,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:53,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:53,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:53,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2026913331, now seen corresponding path program 1 times [2025-03-03 14:50:53,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:53,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69234117] [2025-03-03 14:50:53,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:53,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:53,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 14:50:53,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 14:50:53,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:53,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:53,608 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 14:50:53,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:53,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69234117] [2025-03-03 14:50:53,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69234117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:53,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:53,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:50:53,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018620117] [2025-03-03 14:50:53,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:53,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:50:53,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:53,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:50:53,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:50:53,635 INFO L87 Difference]: Start difference. First operand has 57 states, 55 states have (on average 1.690909090909091) internal successors, (93), 56 states have internal predecessors, (93), 0 states have call successors, (0), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:53,648 INFO L93 Difference]: Finished difference Result 90 states and 146 transitions. [2025-03-03 14:50:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:50:53,650 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-03 14:50:53,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:53,655 INFO L225 Difference]: With dead ends: 90 [2025-03-03 14:50:53,656 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 14:50:53,657 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 14:50:53,660 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:53,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:53,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 14:50:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-03 14:50:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 53 states have internal predecessors, (88), 0 states have call successors, (0), 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 14:50:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 88 transitions. [2025-03-03 14:50:53,689 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 88 transitions. Word has length 19 [2025-03-03 14:50:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:53,689 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 88 transitions. [2025-03-03 14:50:53,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 88 transitions. [2025-03-03 14:50:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 14:50:53,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:53,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:53,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:50:53,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:53,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1521354706, now seen corresponding path program 1 times [2025-03-03 14:50:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:53,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271321872] [2025-03-03 14:50:53,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:53,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:53,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 14:50:53,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 14:50:53,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:53,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:53,896 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 14:50:53,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:53,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271321872] [2025-03-03 14:50:53,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271321872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:53,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:53,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:53,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208112992] [2025-03-03 14:50:53,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:53,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:53,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:53,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:53,898 INFO L87 Difference]: Start difference. First operand 54 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:53,946 INFO L93 Difference]: Finished difference Result 90 states and 142 transitions. [2025-03-03 14:50:53,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:50:53,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-03 14:50:53,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:53,949 INFO L225 Difference]: With dead ends: 90 [2025-03-03 14:50:53,949 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 14:50:53,950 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 14:50:53,951 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:53,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:53,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 14:50:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-03 14:50:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 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 14:50:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2025-03-03 14:50:53,958 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 19 [2025-03-03 14:50:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:53,959 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2025-03-03 14:50:53,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2025-03-03 14:50:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 14:50:53,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:53,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:53,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:50:53,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:53,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:53,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1280739170, now seen corresponding path program 1 times [2025-03-03 14:50:53,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:53,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399393467] [2025-03-03 14:50:53,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:53,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:53,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 14:50:53,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:50:53,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:53,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:54,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:54,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399393467] [2025-03-03 14:50:54,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399393467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:54,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:54,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:54,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942802285] [2025-03-03 14:50:54,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:54,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:54,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:54,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:54,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:54,073 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 14:50:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:54,190 INFO L93 Difference]: Finished difference Result 246 states and 372 transitions. [2025-03-03 14:50:54,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:50:54,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-03 14:50:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:54,191 INFO L225 Difference]: With dead ends: 246 [2025-03-03 14:50:54,191 INFO L226 Difference]: Without dead ends: 214 [2025-03-03 14:50:54,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:50:54,192 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 327 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:54,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 350 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:50:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-03 14:50:54,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 84. [2025-03-03 14:50:54,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 83 states have internal predecessors, (119), 0 states have call successors, (0), 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 14:50:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2025-03-03 14:50:54,210 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 34 [2025-03-03 14:50:54,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:54,210 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2025-03-03 14:50:54,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 14:50:54,210 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2025-03-03 14:50:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:50:54,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:54,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:54,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:50:54,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:54,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:54,212 INFO L85 PathProgramCache]: Analyzing trace with hash -744918371, now seen corresponding path program 1 times [2025-03-03 14:50:54,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:54,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80853896] [2025-03-03 14:50:54,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:54,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:54,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:50:54,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:50:54,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:54,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:54,293 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 14:50:54,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:54,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80853896] [2025-03-03 14:50:54,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80853896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:54,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:54,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:54,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215496738] [2025-03-03 14:50:54,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:54,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:54,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:54,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:54,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:54,295 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 14:50:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:54,319 INFO L93 Difference]: Finished difference Result 197 states and 294 transitions. [2025-03-03 14:50:54,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:54,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:50:54,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:54,320 INFO L225 Difference]: With dead ends: 197 [2025-03-03 14:50:54,320 INFO L226 Difference]: Without dead ends: 135 [2025-03-03 14:50:54,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:54,321 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:54,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 111 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-03 14:50:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2025-03-03 14:50:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4538461538461538) internal successors, (189), 130 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 14:50:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 189 transitions. [2025-03-03 14:50:54,331 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 189 transitions. Word has length 36 [2025-03-03 14:50:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:54,332 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 189 transitions. [2025-03-03 14:50:54,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 14:50:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 189 transitions. [2025-03-03 14:50:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:50:54,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:54,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:54,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:50:54,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:54,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash -712595136, now seen corresponding path program 1 times [2025-03-03 14:50:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:54,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036604603] [2025-03-03 14:50:54,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:54,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:54,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:50:54,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:50:54,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:54,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:54,527 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 14:50:54,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:54,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036604603] [2025-03-03 14:50:54,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036604603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:54,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:54,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:54,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872907837] [2025-03-03 14:50:54,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:54,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:54,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:54,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:54,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:54,530 INFO L87 Difference]: Start difference. First operand 131 states and 189 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 14:50:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:54,580 INFO L93 Difference]: Finished difference Result 242 states and 357 transitions. [2025-03-03 14:50:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:50:54,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:50:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:54,581 INFO L225 Difference]: With dead ends: 242 [2025-03-03 14:50:54,581 INFO L226 Difference]: Without dead ends: 133 [2025-03-03 14:50:54,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:50:54,582 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 74 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:54,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 160 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-03 14:50:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2025-03-03 14:50:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4384615384615385) internal successors, (187), 130 states have internal predecessors, (187), 0 states have call successors, (0), 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 14:50:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 187 transitions. [2025-03-03 14:50:54,590 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 187 transitions. Word has length 36 [2025-03-03 14:50:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:54,590 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 187 transitions. [2025-03-03 14:50:54,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 14:50:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 187 transitions. [2025-03-03 14:50:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:50:54,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:54,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:54,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:50:54,591 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:54,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:54,591 INFO L85 PathProgramCache]: Analyzing trace with hash -585075003, now seen corresponding path program 1 times [2025-03-03 14:50:54,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:54,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-03-03 14:50:54,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:54,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:54,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 14:50:54,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:50:54,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:54,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:54,735 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 14:50:54,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:54,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-03-03 14:50:54,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967039731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:54,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:54,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:54,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371803463] [2025-03-03 14:50:54,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:54,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:54,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:54,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:54,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:54,736 INFO L87 Difference]: Start difference. First operand 131 states and 187 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:54,757 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2025-03-03 14:50:54,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:50:54,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 14:50:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:54,761 INFO L225 Difference]: With dead ends: 139 [2025-03-03 14:50:54,761 INFO L226 Difference]: Without dead ends: 137 [2025-03-03 14:50:54,761 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 14:50:54,761 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:54,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:54,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-03 14:50:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-03 14:50:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.411764705882353) internal successors, (192), 136 states have internal predecessors, (192), 0 states have call successors, (0), 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 14:50:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2025-03-03 14:50:54,772 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 37 [2025-03-03 14:50:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:54,772 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions. [2025-03-03 14:50:54,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions. [2025-03-03 14:50:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 14:50:54,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:54,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:54,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:50:54,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:54,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:54,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1711257022, now seen corresponding path program 1 times [2025-03-03 14:50:54,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:54,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464739465] [2025-03-03 14:50:54,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:54,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:54,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 14:50:54,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 14:50:54,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:54,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:54,827 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 14:50:54,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:54,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464739465] [2025-03-03 14:50:54,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464739465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:54,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:54,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:54,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342933002] [2025-03-03 14:50:54,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:54,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:54,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:54,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:54,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:54,829 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:54,840 INFO L93 Difference]: Finished difference Result 351 states and 504 transitions. [2025-03-03 14:50:54,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:54,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 14:50:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:54,842 INFO L225 Difference]: With dead ends: 351 [2025-03-03 14:50:54,842 INFO L226 Difference]: Without dead ends: 236 [2025-03-03 14:50:54,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:54,844 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 38 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:54,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-03 14:50:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2025-03-03 14:50:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.4120171673819744) internal successors, (329), 233 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 329 transitions. [2025-03-03 14:50:54,861 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 329 transitions. Word has length 38 [2025-03-03 14:50:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:54,861 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 329 transitions. [2025-03-03 14:50:54,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 329 transitions. [2025-03-03 14:50:54,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 14:50:54,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:54,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:54,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:50:54,862 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:54,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:54,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1224538750, now seen corresponding path program 1 times [2025-03-03 14:50:54,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:54,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650783885] [2025-03-03 14:50:54,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:54,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:54,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 14:50:54,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 14:50:54,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:54,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:54,906 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 14:50:54,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:54,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650783885] [2025-03-03 14:50:54,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650783885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:54,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:54,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:54,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105911927] [2025-03-03 14:50:54,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:54,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:54,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:54,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:54,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:54,907 INFO L87 Difference]: Start difference. First operand 234 states and 329 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:54,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:54,925 INFO L93 Difference]: Finished difference Result 626 states and 887 transitions. [2025-03-03 14:50:54,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:54,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 14:50:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:54,927 INFO L225 Difference]: With dead ends: 626 [2025-03-03 14:50:54,927 INFO L226 Difference]: Without dead ends: 414 [2025-03-03 14:50:54,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:54,929 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 36 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:54,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-03 14:50:54,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412. [2025-03-03 14:50:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.389294403892944) internal successors, (571), 411 states have internal predecessors, (571), 0 states have call successors, (0), 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 14:50:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 571 transitions. [2025-03-03 14:50:54,947 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 571 transitions. Word has length 38 [2025-03-03 14:50:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:54,948 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 571 transitions. [2025-03-03 14:50:54,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:54,948 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 571 transitions. [2025-03-03 14:50:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 14:50:54,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:54,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:54,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:50:54,950 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1452893534, now seen corresponding path program 1 times [2025-03-03 14:50:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363119965] [2025-03-03 14:50:54,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:54,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 14:50:54,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 14:50:54,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:54,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:55,004 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 14:50:55,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:55,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363119965] [2025-03-03 14:50:55,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363119965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:55,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:55,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:55,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833253570] [2025-03-03 14:50:55,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:55,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:55,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:55,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:55,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:55,006 INFO L87 Difference]: Start difference. First operand 412 states and 571 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:55,022 INFO L93 Difference]: Finished difference Result 835 states and 1177 transitions. [2025-03-03 14:50:55,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:55,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-03 14:50:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:55,025 INFO L225 Difference]: With dead ends: 835 [2025-03-03 14:50:55,025 INFO L226 Difference]: Without dead ends: 600 [2025-03-03 14:50:55,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:55,028 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 37 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:55,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-03 14:50:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2025-03-03 14:50:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.3819095477386936) internal successors, (825), 597 states have internal predecessors, (825), 0 states have call successors, (0), 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 14:50:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 825 transitions. [2025-03-03 14:50:55,044 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 825 transitions. Word has length 40 [2025-03-03 14:50:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:55,044 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 825 transitions. [2025-03-03 14:50:55,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 825 transitions. [2025-03-03 14:50:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 14:50:55,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:55,047 INFO L218 NwaCegarLoop]: trace histogram [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 14:50:55,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:50:55,048 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:55,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:55,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1948030485, now seen corresponding path program 1 times [2025-03-03 14:50:55,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:55,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376904304] [2025-03-03 14:50:55,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:55,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:55,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 14:50:55,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 14:50:55,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:55,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:50:55,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:55,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376904304] [2025-03-03 14:50:55,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376904304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:55,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:55,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:55,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501465398] [2025-03-03 14:50:55,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:55,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:55,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:55,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:55,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:55,178 INFO L87 Difference]: Start difference. First operand 598 states and 825 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 14:50:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:55,262 INFO L93 Difference]: Finished difference Result 2454 states and 3405 transitions. [2025-03-03 14:50:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:50:55,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 14:50:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:55,269 INFO L225 Difference]: With dead ends: 2454 [2025-03-03 14:50:55,269 INFO L226 Difference]: Without dead ends: 1880 [2025-03-03 14:50:55,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:50:55,270 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 173 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:55,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 291 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2025-03-03 14:50:55,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1170. [2025-03-03 14:50:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1169 states have (on average 1.3798118049615056) internal successors, (1613), 1169 states have internal predecessors, (1613), 0 states have call successors, (0), 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 14:50:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1613 transitions. [2025-03-03 14:50:55,322 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1613 transitions. Word has length 53 [2025-03-03 14:50:55,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:55,322 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1613 transitions. [2025-03-03 14:50:55,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 14:50:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1613 transitions. [2025-03-03 14:50:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 14:50:55,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:55,323 INFO L218 NwaCegarLoop]: trace histogram [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 14:50:55,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:50:55,323 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:55,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1461312213, now seen corresponding path program 1 times [2025-03-03 14:50:55,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:55,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109840723] [2025-03-03 14:50:55,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:55,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:55,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 14:50:55,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 14:50:55,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:55,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:50:55,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:55,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109840723] [2025-03-03 14:50:55,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109840723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:55,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:55,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:55,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361650188] [2025-03-03 14:50:55,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:55,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:55,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:55,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:55,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:55,437 INFO L87 Difference]: Start difference. First operand 1170 states and 1613 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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 14:50:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:55,543 INFO L93 Difference]: Finished difference Result 3026 states and 4193 transitions. [2025-03-03 14:50:55,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:50:55,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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 14:50:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:55,552 INFO L225 Difference]: With dead ends: 3026 [2025-03-03 14:50:55,552 INFO L226 Difference]: Without dead ends: 2452 [2025-03-03 14:50:55,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:50:55,557 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 177 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:55,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 278 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-03-03 14:50:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2030. [2025-03-03 14:50:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 2029 states have (on average 1.3725973385904386) internal successors, (2785), 2029 states have internal predecessors, (2785), 0 states have call successors, (0), 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 14:50:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2785 transitions. [2025-03-03 14:50:55,623 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2785 transitions. Word has length 53 [2025-03-03 14:50:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:55,623 INFO L471 AbstractCegarLoop]: Abstraction has 2030 states and 2785 transitions. [2025-03-03 14:50:55,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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 14:50:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2785 transitions. [2025-03-03 14:50:55,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 14:50:55,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:55,624 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] [2025-03-03 14:50:55,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:50:55,624 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:55,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash 604231475, now seen corresponding path program 1 times [2025-03-03 14:50:55,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:55,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487822235] [2025-03-03 14:50:55,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:55,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:55,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 14:50:55,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 14:50:55,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:55,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:55,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:55,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487822235] [2025-03-03 14:50:55,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487822235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:55,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:55,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:55,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441935456] [2025-03-03 14:50:55,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:55,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:55,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:55,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:55,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:55,706 INFO L87 Difference]: Start difference. First operand 2030 states and 2785 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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 14:50:55,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:55,741 INFO L93 Difference]: Finished difference Result 3506 states and 4848 transitions. [2025-03-03 14:50:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:55,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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 14:50:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:55,746 INFO L225 Difference]: With dead ends: 3506 [2025-03-03 14:50:55,746 INFO L226 Difference]: Without dead ends: 1500 [2025-03-03 14:50:55,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:55,750 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:55,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 153 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2025-03-03 14:50:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1498. [2025-03-03 14:50:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1497 states have (on average 1.3740814963259853) internal successors, (2057), 1497 states have internal predecessors, (2057), 0 states have call successors, (0), 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 14:50:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 2057 transitions. [2025-03-03 14:50:55,797 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 2057 transitions. Word has length 55 [2025-03-03 14:50:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:55,797 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 2057 transitions. [2025-03-03 14:50:55,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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 14:50:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 2057 transitions. [2025-03-03 14:50:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 14:50:55,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:55,798 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:55,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:50:55,798 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:55,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1358924789, now seen corresponding path program 1 times [2025-03-03 14:50:55,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:55,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764418789] [2025-03-03 14:50:55,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:55,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:55,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 14:50:55,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 14:50:55,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:55,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:50:55,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:55,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764418789] [2025-03-03 14:50:55,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764418789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:55,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:55,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:55,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852422772] [2025-03-03 14:50:55,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:55,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:55,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:55,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:55,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:55,884 INFO L87 Difference]: Start difference. First operand 1498 states and 2057 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 14:50:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:55,953 INFO L93 Difference]: Finished difference Result 2754 states and 3813 transitions. [2025-03-03 14:50:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:50:55,954 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 55 [2025-03-03 14:50:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:55,961 INFO L225 Difference]: With dead ends: 2754 [2025-03-03 14:50:55,961 INFO L226 Difference]: Without dead ends: 2336 [2025-03-03 14:50:55,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:50:55,963 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 173 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:55,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 296 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2025-03-03 14:50:56,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 1914. [2025-03-03 14:50:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.3763721902770518) internal successors, (2633), 1913 states have internal predecessors, (2633), 0 states have call successors, (0), 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 14:50:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2633 transitions. [2025-03-03 14:50:56,010 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2633 transitions. Word has length 55 [2025-03-03 14:50:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:56,010 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2633 transitions. [2025-03-03 14:50:56,011 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 14:50:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2633 transitions. [2025-03-03 14:50:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:50:56,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:56,011 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 14:50:56,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:50:56,012 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:56,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:56,012 INFO L85 PathProgramCache]: Analyzing trace with hash 968103256, now seen corresponding path program 1 times [2025-03-03 14:50:56,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:56,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675024208] [2025-03-03 14:50:56,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:56,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:56,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 14:50:56,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 14:50:56,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:56,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:56,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:56,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675024208] [2025-03-03 14:50:56,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675024208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:56,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:56,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:56,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886362035] [2025-03-03 14:50:56,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:56,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:56,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:56,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:56,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:56,064 INFO L87 Difference]: Start difference. First operand 1914 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 14:50:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:56,087 INFO L93 Difference]: Finished difference Result 2854 states and 3931 transitions. [2025-03-03 14:50:56,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:56,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 14:50:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:56,091 INFO L225 Difference]: With dead ends: 2854 [2025-03-03 14:50:56,091 INFO L226 Difference]: Without dead ends: 980 [2025-03-03 14:50:56,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:56,093 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 29 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:56,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 138 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2025-03-03 14:50:56,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 978. [2025-03-03 14:50:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 1.3500511770726715) internal successors, (1319), 977 states have internal predecessors, (1319), 0 states have call successors, (0), 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 14:50:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1319 transitions. [2025-03-03 14:50:56,113 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1319 transitions. Word has length 56 [2025-03-03 14:50:56,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:56,113 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1319 transitions. [2025-03-03 14:50:56,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 14:50:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1319 transitions. [2025-03-03 14:50:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 14:50:56,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:56,114 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:56,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:50:56,114 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:56,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:56,115 INFO L85 PathProgramCache]: Analyzing trace with hash -937467809, now seen corresponding path program 1 times [2025-03-03 14:50:56,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:56,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783432120] [2025-03-03 14:50:56,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:56,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:56,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 14:50:56,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 14:50:56,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:56,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:56,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783432120] [2025-03-03 14:50:56,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783432120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:56,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:56,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019589665] [2025-03-03 14:50:56,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:56,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:56,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:56,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:56,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:56,164 INFO L87 Difference]: Start difference. First operand 978 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 14:50:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:56,179 INFO L93 Difference]: Finished difference Result 1450 states and 1960 transitions. [2025-03-03 14:50:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:56,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 14:50:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:56,181 INFO L225 Difference]: With dead ends: 1450 [2025-03-03 14:50:56,181 INFO L226 Difference]: Without dead ends: 512 [2025-03-03 14:50:56,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:56,182 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 26 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:56,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 123 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:56,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-03 14:50:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2025-03-03 14:50:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.3182711198428292) internal successors, (671), 509 states have internal predecessors, (671), 0 states have call successors, (0), 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 14:50:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 671 transitions. [2025-03-03 14:50:56,194 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 671 transitions. Word has length 58 [2025-03-03 14:50:56,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:56,194 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 671 transitions. [2025-03-03 14:50:56,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 14:50:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 671 transitions. [2025-03-03 14:50:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 14:50:56,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:56,195 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:56,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:50:56,195 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:56,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:56,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1458136198, now seen corresponding path program 1 times [2025-03-03 14:50:56,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:56,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724134418] [2025-03-03 14:50:56,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:56,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:56,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 14:50:56,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 14:50:56,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:56,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:57,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:57,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724134418] [2025-03-03 14:50:57,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724134418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:50:57,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563124148] [2025-03-03 14:50:57,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:57,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:50:57,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:50:57,229 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 14:50:57,231 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 14:50:57,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 14:50:57,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 14:50:57,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:57,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:57,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:50:57,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:50:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:57,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:50:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:58,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563124148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:50:58,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:50:58,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-03 14:50:58,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571207836] [2025-03-03 14:50:58,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:50:58,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 14:50:58,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:58,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 14:50:58,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:50:58,338 INFO L87 Difference]: Start difference. First operand 510 states and 671 transitions. Second operand has 28 states, 28 states have (on average 5.392857142857143) internal successors, (151), 27 states have internal predecessors, (151), 0 states have call successors, (0), 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 14:50:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:59,434 INFO L93 Difference]: Finished difference Result 2740 states and 3649 transitions. [2025-03-03 14:50:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 14:50:59,435 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.392857142857143) internal successors, (151), 27 states have internal predecessors, (151), 0 states have call successors, (0), 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 60 [2025-03-03 14:50:59,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:59,440 INFO L225 Difference]: With dead ends: 2740 [2025-03-03 14:50:59,440 INFO L226 Difference]: Without dead ends: 2270 [2025-03-03 14:50:59,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=565, Invalid=2515, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 14:50:59,443 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 1325 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:59,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 897 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:50:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2025-03-03 14:50:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2040. [2025-03-03 14:50:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 2039 states have (on average 1.3222167729279057) internal successors, (2696), 2039 states have internal predecessors, (2696), 0 states have call successors, (0), 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 14:50:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 2696 transitions. [2025-03-03 14:50:59,488 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 2696 transitions. Word has length 60 [2025-03-03 14:50:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:59,488 INFO L471 AbstractCegarLoop]: Abstraction has 2040 states and 2696 transitions. [2025-03-03 14:50:59,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.392857142857143) internal successors, (151), 27 states have internal predecessors, (151), 0 states have call successors, (0), 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 14:50:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2696 transitions. [2025-03-03 14:50:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 14:50:59,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:59,490 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:59,496 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 14:50:59,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 14:50:59,694 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:59,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:59,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1820963702, now seen corresponding path program 1 times [2025-03-03 14:50:59,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:59,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148396904] [2025-03-03 14:50:59,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:59,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:59,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:50:59,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:50:59,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:59,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:59,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:59,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148396904] [2025-03-03 14:50:59,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148396904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:50:59,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846804341] [2025-03-03 14:50:59,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:59,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:50:59,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:50:59,921 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 14:50:59,923 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 14:50:59,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:50:59,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:50:59,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:59,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:59,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 14:50:59,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:00,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:01,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846804341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:01,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:01,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2025-03-03 14:51:01,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454093128] [2025-03-03 14:51:01,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:01,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 14:51:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:01,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 14:51:01,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:51:01,133 INFO L87 Difference]: Start difference. First operand 2040 states and 2696 transitions. Second operand has 28 states, 28 states have (on average 5.857142857142857) internal successors, (164), 28 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 14:51:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:02,368 INFO L93 Difference]: Finished difference Result 6780 states and 9015 transitions. [2025-03-03 14:51:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 14:51:02,369 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.857142857142857) internal successors, (164), 28 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) Word has length 61 [2025-03-03 14:51:02,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:02,381 INFO L225 Difference]: With dead ends: 6780 [2025-03-03 14:51:02,381 INFO L226 Difference]: Without dead ends: 4780 [2025-03-03 14:51:02,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=555, Invalid=2201, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 14:51:02,385 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1324 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:02,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 552 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:51:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4780 states. [2025-03-03 14:51:02,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4780 to 2798. [2025-03-03 14:51:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 1.3063997139792636) internal successors, (3654), 2797 states have internal predecessors, (3654), 0 states have call successors, (0), 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 14:51:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 3654 transitions. [2025-03-03 14:51:02,453 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 3654 transitions. Word has length 61 [2025-03-03 14:51:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:02,454 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 3654 transitions. [2025-03-03 14:51:02,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.857142857142857) internal successors, (164), 28 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 14:51:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3654 transitions. [2025-03-03 14:51:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 14:51:02,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:02,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:51:02,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:51:02,659 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,SelfDestructingSolverStorable16 [2025-03-03 14:51:02,659 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:02,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:02,659 INFO L85 PathProgramCache]: Analyzing trace with hash 460773034, now seen corresponding path program 1 times [2025-03-03 14:51:02,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:02,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627384604] [2025-03-03 14:51:02,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:02,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:02,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:51:02,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:51:02,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:02,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:02,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:02,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627384604] [2025-03-03 14:51:02,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627384604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:02,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074517058] [2025-03-03 14:51:02,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:02,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:02,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:02,862 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 14:51:02,864 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 14:51:02,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:51:02,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:51:02,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:02,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:02,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:51:02,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:03,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:03,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074517058] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:03,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:03,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-03 14:51:03,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392552656] [2025-03-03 14:51:03,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:03,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 14:51:03,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:03,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 14:51:03,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:51:03,595 INFO L87 Difference]: Start difference. First operand 2798 states and 3654 transitions. Second operand has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 22 states have internal predecessors, (133), 0 states have call successors, (0), 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 14:51:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:03,955 INFO L93 Difference]: Finished difference Result 5560 states and 7270 transitions. [2025-03-03 14:51:03,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:51:03,955 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 22 states have internal predecessors, (133), 0 states have call successors, (0), 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 61 [2025-03-03 14:51:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:03,962 INFO L225 Difference]: With dead ends: 5560 [2025-03-03 14:51:03,962 INFO L226 Difference]: Without dead ends: 2802 [2025-03-03 14:51:03,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 14:51:03,964 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 537 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:03,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 490 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:51:03,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2025-03-03 14:51:04,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2798. [2025-03-03 14:51:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 1.2963889882016446) internal successors, (3626), 2797 states have internal predecessors, (3626), 0 states have call successors, (0), 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 14:51:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 3626 transitions. [2025-03-03 14:51:04,022 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 3626 transitions. Word has length 61 [2025-03-03 14:51:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:04,022 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 3626 transitions. [2025-03-03 14:51:04,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 22 states have internal predecessors, (133), 0 states have call successors, (0), 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 14:51:04,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3626 transitions. [2025-03-03 14:51:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 14:51:04,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:04,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:51:04,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:51:04,227 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 14:51:04,227 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:04,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:04,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1274136387, now seen corresponding path program 1 times [2025-03-03 14:51:04,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:04,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365254704] [2025-03-03 14:51:04,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:04,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:51:04,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:51:04,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:04,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:05,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:05,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365254704] [2025-03-03 14:51:05,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365254704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:05,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248803954] [2025-03-03 14:51:05,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:05,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:05,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:05,448 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 14:51:05,450 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 14:51:05,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:51:05,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:51:05,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:05,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:05,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-03 14:51:05,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:07,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248803954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:09,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:09,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 21] total 62 [2025-03-03 14:51:09,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627549839] [2025-03-03 14:51:09,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:09,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-03 14:51:09,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:09,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-03 14:51:09,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=3364, Unknown=0, NotChecked=0, Total=3782 [2025-03-03 14:51:09,884 INFO L87 Difference]: Start difference. First operand 2798 states and 3626 transitions. Second operand has 62 states, 62 states have (on average 2.7419354838709675) internal successors, (170), 62 states have internal predecessors, (170), 0 states have call successors, (0), 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 14:51:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:32,646 INFO L93 Difference]: Finished difference Result 11696 states and 15059 transitions. [2025-03-03 14:51:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2025-03-03 14:51:32,646 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.7419354838709675) internal successors, (170), 62 states have internal predecessors, (170), 0 states have call successors, (0), 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 62 [2025-03-03 14:51:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:32,665 INFO L225 Difference]: With dead ends: 11696 [2025-03-03 14:51:32,665 INFO L226 Difference]: Without dead ends: 10034 [2025-03-03 14:51:32,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12123 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=6954, Invalid=30488, Unknown=0, NotChecked=0, Total=37442 [2025-03-03 14:51:32,674 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 4218 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 3527 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4218 SdHoareTripleChecker+Valid, 3031 SdHoareTripleChecker+Invalid, 3719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 3527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:32,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4218 Valid, 3031 Invalid, 3719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 3527 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 14:51:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10034 states. [2025-03-03 14:51:32,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10034 to 4298. [2025-03-03 14:51:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4298 states, 4297 states have (on average 1.2885734233185944) internal successors, (5537), 4297 states have internal predecessors, (5537), 0 states have call successors, (0), 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 14:51:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4298 states to 4298 states and 5537 transitions. [2025-03-03 14:51:32,832 INFO L78 Accepts]: Start accepts. Automaton has 4298 states and 5537 transitions. Word has length 62 [2025-03-03 14:51:32,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:32,832 INFO L471 AbstractCegarLoop]: Abstraction has 4298 states and 5537 transitions. [2025-03-03 14:51:32,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.7419354838709675) internal successors, (170), 62 states have internal predecessors, (170), 0 states have call successors, (0), 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 14:51:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4298 states and 5537 transitions. [2025-03-03 14:51:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:51:32,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:32,833 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:51:32,840 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 14:51:33,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:33,034 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:33,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1573836679, now seen corresponding path program 1 times [2025-03-03 14:51:33,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:33,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474866706] [2025-03-03 14:51:33,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:33,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:33,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:51:33,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:51:33,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:33,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:33,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:33,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474866706] [2025-03-03 14:51:33,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474866706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:33,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526829158] [2025-03-03 14:51:33,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:33,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:33,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:33,765 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 14:51:33,767 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 14:51:33,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:51:33,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:51:33,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:33,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:33,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:51:33,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:51:33,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:51:34,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526829158] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:34,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:34,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 4] total 25 [2025-03-03 14:51:34,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174974952] [2025-03-03 14:51:34,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:34,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 14:51:34,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:34,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 14:51:34,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:51:34,044 INFO L87 Difference]: Start difference. First operand 4298 states and 5537 transitions. Second operand has 25 states, 25 states have (on average 6.92) internal successors, (173), 25 states have internal predecessors, (173), 0 states have call successors, (0), 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 14:51:39,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:39,129 INFO L93 Difference]: Finished difference Result 12066 states and 15286 transitions. [2025-03-03 14:51:39,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2025-03-03 14:51:39,130 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.92) internal successors, (173), 25 states have internal predecessors, (173), 0 states have call successors, (0), 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 63 [2025-03-03 14:51:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:39,140 INFO L225 Difference]: With dead ends: 12066 [2025-03-03 14:51:39,140 INFO L226 Difference]: Without dead ends: 7808 [2025-03-03 14:51:39,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6342 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3264, Invalid=13248, Unknown=0, NotChecked=0, Total=16512 [2025-03-03 14:51:39,146 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 2924 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2924 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:39,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2924 Valid, 1054 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 14:51:39,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7808 states. [2025-03-03 14:51:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7808 to 6939. [2025-03-03 14:51:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6939 states, 6938 states have (on average 1.2141827616027674) internal successors, (8424), 6938 states have internal predecessors, (8424), 0 states have call successors, (0), 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 14:51:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6939 states to 6939 states and 8424 transitions. [2025-03-03 14:51:39,411 INFO L78 Accepts]: Start accepts. Automaton has 6939 states and 8424 transitions. Word has length 63 [2025-03-03 14:51:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:39,412 INFO L471 AbstractCegarLoop]: Abstraction has 6939 states and 8424 transitions. [2025-03-03 14:51:39,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.92) internal successors, (173), 25 states have internal predecessors, (173), 0 states have call successors, (0), 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 14:51:39,412 INFO L276 IsEmpty]: Start isEmpty. Operand 6939 states and 8424 transitions. [2025-03-03 14:51:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:51:39,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:39,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:51:39,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:51:39,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:39,613 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:39,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1335551488, now seen corresponding path program 1 times [2025-03-03 14:51:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:39,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103065869] [2025-03-03 14:51:39,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:39,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:39,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:51:39,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:51:39,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:39,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:40,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:40,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103065869] [2025-03-03 14:51:40,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103065869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:40,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924536559] [2025-03-03 14:51:40,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:40,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:40,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:40,285 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 14:51:40,286 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 14:51:40,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:51:40,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:51:40,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:40,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:40,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 14:51:40,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:41,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:43,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924536559] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:43,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:43,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 21] total 53 [2025-03-03 14:51:43,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875867155] [2025-03-03 14:51:43,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:43,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-03 14:51:43,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:43,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-03 14:51:43,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=2426, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 14:51:43,637 INFO L87 Difference]: Start difference. First operand 6939 states and 8424 transitions. Second operand has 53 states, 53 states have (on average 3.169811320754717) internal successors, (168), 53 states have internal predecessors, (168), 0 states have call successors, (0), 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 14:52:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:00,239 INFO L93 Difference]: Finished difference Result 18064 states and 22055 transitions. [2025-03-03 14:52:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2025-03-03 14:52:00,239 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.169811320754717) internal successors, (168), 53 states have internal predecessors, (168), 0 states have call successors, (0), 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 64 [2025-03-03 14:52:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:00,257 INFO L225 Difference]: With dead ends: 18064 [2025-03-03 14:52:00,257 INFO L226 Difference]: Without dead ends: 14545 [2025-03-03 14:52:00,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9897 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=5123, Invalid=23607, Unknown=0, NotChecked=0, Total=28730 [2025-03-03 14:52:00,262 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 3810 mSDsluCounter, 3281 mSDsCounter, 0 mSdLazyCounter, 3253 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3810 SdHoareTripleChecker+Valid, 3411 SdHoareTripleChecker+Invalid, 3378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 3253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:00,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3810 Valid, 3411 Invalid, 3378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 3253 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:52:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14545 states. [2025-03-03 14:52:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14545 to 5841. [2025-03-03 14:52:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5841 states, 5840 states have (on average 1.2183219178082192) internal successors, (7115), 5840 states have internal predecessors, (7115), 0 states have call successors, (0), 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 14:52:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5841 states to 5841 states and 7115 transitions. [2025-03-03 14:52:00,579 INFO L78 Accepts]: Start accepts. Automaton has 5841 states and 7115 transitions. Word has length 64 [2025-03-03 14:52:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:00,579 INFO L471 AbstractCegarLoop]: Abstraction has 5841 states and 7115 transitions. [2025-03-03 14:52:00,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.169811320754717) internal successors, (168), 53 states have internal predecessors, (168), 0 states have call successors, (0), 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 14:52:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand 5841 states and 7115 transitions. [2025-03-03 14:52:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:52:00,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:00,581 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:00,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:52:00,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:52:00,785 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:00,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:00,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1411518596, now seen corresponding path program 1 times [2025-03-03 14:52:00,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:00,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134081385] [2025-03-03 14:52:00,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:00,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:00,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:52:00,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:52:00,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:00,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 26 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:01,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:01,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134081385] [2025-03-03 14:52:01,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134081385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:52:01,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224456289] [2025-03-03 14:52:01,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:01,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:52:01,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:52:01,437 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 14:52:01,439 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 14:52:01,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:52:01,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:52:01,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:01,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:01,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 14:52:01,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:52:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 44 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:02,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:52:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:03,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224456289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:52:03,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:52:03,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 41 [2025-03-03 14:52:03,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424962985] [2025-03-03 14:52:03,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:52:03,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 14:52:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:03,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 14:52:03,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1506, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 14:52:03,933 INFO L87 Difference]: Start difference. First operand 5841 states and 7115 transitions. Second operand has 41 states, 41 states have (on average 6.975609756097561) internal successors, (286), 41 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 14:52:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:10,984 INFO L93 Difference]: Finished difference Result 11956 states and 14582 transitions. [2025-03-03 14:52:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-03 14:52:10,984 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.975609756097561) internal successors, (286), 41 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 103 [2025-03-03 14:52:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:10,994 INFO L225 Difference]: With dead ends: 11956 [2025-03-03 14:52:10,994 INFO L226 Difference]: Without dead ends: 7778 [2025-03-03 14:52:10,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3331 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2422, Invalid=10918, Unknown=0, NotChecked=0, Total=13340 [2025-03-03 14:52:10,999 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 2293 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2293 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:10,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2293 Valid, 1949 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2160 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 14:52:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7778 states. [2025-03-03 14:52:11,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7778 to 6312. [2025-03-03 14:52:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6312 states, 6311 states have (on average 1.2080494374900967) internal successors, (7624), 6311 states have internal predecessors, (7624), 0 states have call successors, (0), 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 14:52:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6312 states to 6312 states and 7624 transitions. [2025-03-03 14:52:11,336 INFO L78 Accepts]: Start accepts. Automaton has 6312 states and 7624 transitions. Word has length 103 [2025-03-03 14:52:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:11,336 INFO L471 AbstractCegarLoop]: Abstraction has 6312 states and 7624 transitions. [2025-03-03 14:52:11,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.975609756097561) internal successors, (286), 41 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 14:52:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 6312 states and 7624 transitions. [2025-03-03 14:52:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:52:11,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:11,337 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:11,344 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 14:52:11,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:52:11,538 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:11,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:11,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1993064573, now seen corresponding path program 1 times [2025-03-03 14:52:11,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:11,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289223467] [2025-03-03 14:52:11,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:11,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:11,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:52:11,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:52:11,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:11,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:12,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:12,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289223467] [2025-03-03 14:52:12,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289223467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:52:12,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570917784] [2025-03-03 14:52:12,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:12,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:52:12,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:52:12,449 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 14:52:12,450 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 14:52:12,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:52:12,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:52:12,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:12,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:12,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:52:12,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:52:13,054 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 20 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:13,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:52:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570917784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:52:13,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:52:13,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 11] total 40 [2025-03-03 14:52:13,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197224616] [2025-03-03 14:52:13,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:52:13,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-03 14:52:13,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:13,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-03 14:52:13,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1429, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 14:52:13,976 INFO L87 Difference]: Start difference. First operand 6312 states and 7624 transitions. Second operand has 40 states, 40 states have (on average 7.075) internal successors, (283), 40 states have internal predecessors, (283), 0 states have call successors, (0), 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 14:52:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:19,627 INFO L93 Difference]: Finished difference Result 21573 states and 26180 transitions. [2025-03-03 14:52:19,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-03 14:52:19,627 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.075) internal successors, (283), 40 states have internal predecessors, (283), 0 states have call successors, (0), 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 103 [2025-03-03 14:52:19,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:19,644 INFO L225 Difference]: With dead ends: 21573 [2025-03-03 14:52:19,645 INFO L226 Difference]: Without dead ends: 17621 [2025-03-03 14:52:19,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3055 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2082, Invalid=9474, Unknown=0, NotChecked=0, Total=11556 [2025-03-03 14:52:19,649 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1946 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1946 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:19,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1946 Valid, 2052 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 14:52:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17621 states. [2025-03-03 14:52:20,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17621 to 10649. [2025-03-03 14:52:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10649 states, 10648 states have (on average 1.209710743801653) internal successors, (12881), 10648 states have internal predecessors, (12881), 0 states have call successors, (0), 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 14:52:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10649 states to 10649 states and 12881 transitions. [2025-03-03 14:52:20,286 INFO L78 Accepts]: Start accepts. Automaton has 10649 states and 12881 transitions. Word has length 103 [2025-03-03 14:52:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:20,286 INFO L471 AbstractCegarLoop]: Abstraction has 10649 states and 12881 transitions. [2025-03-03 14:52:20,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.075) internal successors, (283), 40 states have internal predecessors, (283), 0 states have call successors, (0), 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 14:52:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 10649 states and 12881 transitions. [2025-03-03 14:52:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:52:20,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:20,288 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:20,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 14:52:20,488 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,SelfDestructingSolverStorable22 [2025-03-03 14:52:20,489 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:20,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:20,489 INFO L85 PathProgramCache]: Analyzing trace with hash -613074927, now seen corresponding path program 1 times [2025-03-03 14:52:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:20,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207485858] [2025-03-03 14:52:20,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:20,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:20,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:52:20,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:52:20,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:20,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:21,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:21,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207485858] [2025-03-03 14:52:21,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207485858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:52:21,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98134421] [2025-03-03 14:52:21,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:21,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:52:21,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:52:21,077 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 14:52:21,079 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 14:52:21,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:52:21,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:52:21,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:21,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:21,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-03 14:52:21,175 INFO L279 TraceCheckSpWp]: Computing forward predicates...