./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label10.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 68bba3302e6a94fc1a2bd97d9ea3c006d28b9ba843bd296b9f627a896167b8ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:50:16,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:50:17,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:50:17,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:50:17,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:50:17,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:50:17,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:50:17,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:50:17,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:50:17,050 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:50:17,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:50:17,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:50:17,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:50:17,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:50:17,051 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:50:17,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:50:17,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:50:17,051 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:50:17,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:50:17,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:50:17,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:50:17,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:50:17,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:50:17,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:50:17,052 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:50:17,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:50:17,052 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:50:17,052 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:50:17,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:50:17,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:50:17,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:50:17,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:50:17,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:50:17,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:50:17,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:50:17,053 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:50:17,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:50:17,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:50:17,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:50:17,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:50:17,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:50:17,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:50:17,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:50:17,053 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 -> 68bba3302e6a94fc1a2bd97d9ea3c006d28b9ba843bd296b9f627a896167b8ce [2025-03-16 14:50:17,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:50:17,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:50:17,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:50:17,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:50:17,262 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:50:17,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label10.c [2025-03-16 14:50:18,376 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/513d703d7/e60e620826e44a49882bb816e3d3d704/FLAG220b7adfe [2025-03-16 14:50:18,655 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:50:18,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label10.c [2025-03-16 14:50:18,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/513d703d7/e60e620826e44a49882bb816e3d3d704/FLAG220b7adfe [2025-03-16 14:50:18,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/513d703d7/e60e620826e44a49882bb816e3d3d704 [2025-03-16 14:50:18,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:50:18,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:50:18,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:50:18,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:50:18,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:50:18,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:50:18" (1/1) ... [2025-03-16 14:50:18,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31623347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:18, skipping insertion in model container [2025-03-16 14:50:18,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:50:18" (1/1) ... [2025-03-16 14:50:18,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:50:18,837 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/eca-rers2012/Problem11_label10.c[3268,3281] [2025-03-16 14:50:18,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:50:18,988 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:50:18,998 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/eca-rers2012/Problem11_label10.c[3268,3281] [2025-03-16 14:50:19,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:50:19,082 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:50:19,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:19 WrapperNode [2025-03-16 14:50:19,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:50:19,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:50:19,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:50:19,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:50:19,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:19" (1/1) ... [2025-03-16 14:50:19,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:19" (1/1) ... [2025-03-16 14:50:19,185 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-16 14:50:19,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:50:19,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:50:19,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:50:19,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:50:19,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:19" (1/1) ... [2025-03-16 14:50:19,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:19" (1/1) ... [2025-03-16 14:50:19,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:19" (1/1) ... [2025-03-16 14:50:19,254 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:50:19,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:19" (1/1) ... [2025-03-16 14:50:19,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:19" (1/1) ... [2025-03-16 14:50:19,281 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:19" (1/1) ... [2025-03-16 14:50:19,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:19" (1/1) ... [2025-03-16 14:50:19,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:19" (1/1) ... [2025-03-16 14:50:19,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:19" (1/1) ... [2025-03-16 14:50:19,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:50:19,311 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:50:19,311 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:50:19,311 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:50:19,312 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:19" (1/1) ... [2025-03-16 14:50:19,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:50:19,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:50:19,337 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:50:19,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:50:19,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:50:19,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:50:19,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:50:19,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:50:19,438 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:50:19,440 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:50:20,544 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-16 14:50:20,544 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:50:20,558 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:50:20,561 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:50:20,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:50:20 BoogieIcfgContainer [2025-03-16 14:50:20,562 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:50:20,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:50:20,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:50:20,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:50:20,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:50:18" (1/3) ... [2025-03-16 14:50:20,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184af998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:50:20, skipping insertion in model container [2025-03-16 14:50:20,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:50:19" (2/3) ... [2025-03-16 14:50:20,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184af998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:50:20, skipping insertion in model container [2025-03-16 14:50:20,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:50:20" (3/3) ... [2025-03-16 14:50:20,569 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label10.c [2025-03-16 14:50:20,579 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:50:20,581 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label10.c that has 1 procedures, 222 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:50:20,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:50:20,644 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;@25eae5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:50:20,644 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:50:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 14:50:20,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:20,655 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] [2025-03-16 14:50:20,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:20,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:20,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1906582837, now seen corresponding path program 1 times [2025-03-16 14:50:20,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:20,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844392116] [2025-03-16 14:50:20,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:20,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 14:50:20,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 14:50:20,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:20,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:20,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:20,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844392116] [2025-03-16 14:50:20,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844392116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:20,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:20,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:50:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025283231] [2025-03-16 14:50:20,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:20,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:50:20,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:20,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:50:20,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:50:20,804 INFO L87 Difference]: Start difference. First operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:20,829 INFO L93 Difference]: Finished difference Result 443 states and 839 transitions. [2025-03-16 14:50:20,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:50:20,830 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-16 14:50:20,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:20,836 INFO L225 Difference]: With dead ends: 443 [2025-03-16 14:50:20,836 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 14:50:20,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:50:20,840 INFO L435 NwaCegarLoop]: 358 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, 358 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:20,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:50:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 14:50:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-16 14:50:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2025-03-16 14:50:20,879 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 21 [2025-03-16 14:50:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:20,879 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2025-03-16 14:50:20,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2025-03-16 14:50:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 14:50:20,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:20,880 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] [2025-03-16 14:50:20,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:50:20,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:20,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1887299187, now seen corresponding path program 1 times [2025-03-16 14:50:20,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:20,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38857656] [2025-03-16 14:50:20,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:20,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:20,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 14:50:20,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 14:50:20,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:20,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:21,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:21,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38857656] [2025-03-16 14:50:21,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38857656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:21,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:21,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:50:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51681923] [2025-03-16 14:50:21,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:21,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:21,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:21,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:21,015 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:21,775 INFO L93 Difference]: Finished difference Result 630 states and 1029 transitions. [2025-03-16 14:50:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:21,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-16 14:50:21,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:21,778 INFO L225 Difference]: With dead ends: 630 [2025-03-16 14:50:21,779 INFO L226 Difference]: Without dead ends: 412 [2025-03-16 14:50:21,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:21,782 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 186 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:21,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 145 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:50:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-16 14:50:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2025-03-16 14:50:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.4596577017114913) internal successors, (597), 409 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2025-03-16 14:50:21,807 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 21 [2025-03-16 14:50:21,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:21,807 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2025-03-16 14:50:21,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2025-03-16 14:50:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 14:50:21,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:21,810 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:21,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:50:21,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:21,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:21,811 INFO L85 PathProgramCache]: Analyzing trace with hash -849977824, now seen corresponding path program 1 times [2025-03-16 14:50:21,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:21,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840634748] [2025-03-16 14:50:21,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:21,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:21,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 14:50:21,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 14:50:21,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:21,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:22,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:22,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840634748] [2025-03-16 14:50:22,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840634748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:22,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:22,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:50:22,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557327013] [2025-03-16 14:50:22,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:22,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:22,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:22,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:22,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:22,041 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:22,744 INFO L93 Difference]: Finished difference Result 1208 states and 1764 transitions. [2025-03-16 14:50:22,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:22,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 14:50:22,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:22,747 INFO L225 Difference]: With dead ends: 1208 [2025-03-16 14:50:22,747 INFO L226 Difference]: Without dead ends: 799 [2025-03-16 14:50:22,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:22,752 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:22,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:50:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-16 14:50:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 786. [2025-03-16 14:50:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.3859872611464967) internal successors, (1088), 785 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1088 transitions. [2025-03-16 14:50:22,783 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1088 transitions. Word has length 89 [2025-03-16 14:50:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:22,784 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1088 transitions. [2025-03-16 14:50:22,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1088 transitions. [2025-03-16 14:50:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 14:50:22,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:22,788 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:22,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:50:22,788 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:22,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:22,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1355646078, now seen corresponding path program 1 times [2025-03-16 14:50:22,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:22,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221951163] [2025-03-16 14:50:22,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:22,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:22,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 14:50:22,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 14:50:22,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:22,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:23,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:23,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221951163] [2025-03-16 14:50:23,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221951163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:23,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:23,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:23,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799292005] [2025-03-16 14:50:23,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:23,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:50:23,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:23,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:50:23,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:23,177 INFO L87 Difference]: Start difference. First operand 786 states and 1088 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:24,141 INFO L93 Difference]: Finished difference Result 2315 states and 3093 transitions. [2025-03-16 14:50:24,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:50:24,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-16 14:50:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:24,148 INFO L225 Difference]: With dead ends: 2315 [2025-03-16 14:50:24,148 INFO L226 Difference]: Without dead ends: 1530 [2025-03-16 14:50:24,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:50:24,152 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 485 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:24,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 217 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:50:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2025-03-16 14:50:24,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1527. [2025-03-16 14:50:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1526 states have (on average 1.2509829619921362) internal successors, (1909), 1526 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1909 transitions. [2025-03-16 14:50:24,179 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1909 transitions. Word has length 90 [2025-03-16 14:50:24,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:24,179 INFO L471 AbstractCegarLoop]: Abstraction has 1527 states and 1909 transitions. [2025-03-16 14:50:24,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1909 transitions. [2025-03-16 14:50:24,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 14:50:24,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:24,180 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:24,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:50:24,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:24,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:24,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1631410072, now seen corresponding path program 1 times [2025-03-16 14:50:24,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:24,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854466381] [2025-03-16 14:50:24,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:24,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:24,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 14:50:24,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 14:50:24,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:24,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 14:50:24,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:24,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854466381] [2025-03-16 14:50:24,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854466381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:24,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:24,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:50:24,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039315120] [2025-03-16 14:50:24,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:24,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:24,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:24,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:24,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:24,348 INFO L87 Difference]: Start difference. First operand 1527 states and 1909 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:24,958 INFO L93 Difference]: Finished difference Result 3430 states and 4427 transitions. [2025-03-16 14:50:24,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:24,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 133 [2025-03-16 14:50:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:24,966 INFO L225 Difference]: With dead ends: 3430 [2025-03-16 14:50:24,966 INFO L226 Difference]: Without dead ends: 2088 [2025-03-16 14:50:24,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:24,970 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:24,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 156 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:24,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2025-03-16 14:50:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2088. [2025-03-16 14:50:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2087 states have (on average 1.2275994250119788) internal successors, (2562), 2087 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2562 transitions. [2025-03-16 14:50:25,001 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2562 transitions. Word has length 133 [2025-03-16 14:50:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:25,002 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2562 transitions. [2025-03-16 14:50:25,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2562 transitions. [2025-03-16 14:50:25,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-16 14:50:25,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:25,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:25,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:50:25,006 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:25,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:25,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1715856716, now seen corresponding path program 1 times [2025-03-16 14:50:25,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:25,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088509912] [2025-03-16 14:50:25,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:25,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:25,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 14:50:25,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 14:50:25,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:25,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:25,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:25,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088509912] [2025-03-16 14:50:25,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088509912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:25,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:25,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:25,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258755076] [2025-03-16 14:50:25,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:25,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:25,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:25,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:25,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:25,163 INFO L87 Difference]: Start difference. First operand 2088 states and 2562 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:25,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:25,691 INFO L93 Difference]: Finished difference Result 5129 states and 6433 transitions. [2025-03-16 14:50:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:25,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-03-16 14:50:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:25,700 INFO L225 Difference]: With dead ends: 5129 [2025-03-16 14:50:25,700 INFO L226 Difference]: Without dead ends: 3226 [2025-03-16 14:50:25,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:25,703 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 213 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:25,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:50:25,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2025-03-16 14:50:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 3223. [2025-03-16 14:50:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 3222 states have (on average 1.2253258845437616) internal successors, (3948), 3222 states have internal predecessors, (3948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 3948 transitions. [2025-03-16 14:50:25,754 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 3948 transitions. Word has length 148 [2025-03-16 14:50:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:25,754 INFO L471 AbstractCegarLoop]: Abstraction has 3223 states and 3948 transitions. [2025-03-16 14:50:25,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 3948 transitions. [2025-03-16 14:50:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-16 14:50:25,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:25,756 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:25,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:50:25,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:25,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash -352997509, now seen corresponding path program 1 times [2025-03-16 14:50:25,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:25,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865794455] [2025-03-16 14:50:25,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:25,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:25,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-16 14:50:25,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-16 14:50:25,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:25,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:25,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:25,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865794455] [2025-03-16 14:50:25,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865794455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:25,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:25,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:25,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977066746] [2025-03-16 14:50:25,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:25,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:25,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:25,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:25,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:25,923 INFO L87 Difference]: Start difference. First operand 3223 states and 3948 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:26,560 INFO L93 Difference]: Finished difference Result 7756 states and 9618 transitions. [2025-03-16 14:50:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:26,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-03-16 14:50:26,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:26,570 INFO L225 Difference]: With dead ends: 7756 [2025-03-16 14:50:26,571 INFO L226 Difference]: Without dead ends: 4718 [2025-03-16 14:50:26,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:26,575 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:26,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 337 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4718 states. [2025-03-16 14:50:26,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4718 to 4514. [2025-03-16 14:50:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4514 states, 4513 states have (on average 1.2020828717039662) internal successors, (5425), 4513 states have internal predecessors, (5425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 5425 transitions. [2025-03-16 14:50:26,634 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 5425 transitions. Word has length 201 [2025-03-16 14:50:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:26,634 INFO L471 AbstractCegarLoop]: Abstraction has 4514 states and 5425 transitions. [2025-03-16 14:50:26,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 5425 transitions. [2025-03-16 14:50:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-16 14:50:26,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:26,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:26,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:50:26,636 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:26,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:26,638 INFO L85 PathProgramCache]: Analyzing trace with hash -417833341, now seen corresponding path program 1 times [2025-03-16 14:50:26,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:26,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338465800] [2025-03-16 14:50:26,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:26,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:26,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-16 14:50:26,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-16 14:50:26,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:26,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 14:50:26,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:26,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338465800] [2025-03-16 14:50:26,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338465800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:26,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:26,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:26,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25880386] [2025-03-16 14:50:26,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:26,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:26,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:26,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:26,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:26,787 INFO L87 Difference]: Start difference. First operand 4514 states and 5425 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:27,337 INFO L93 Difference]: Finished difference Result 9964 states and 12030 transitions. [2025-03-16 14:50:27,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:27,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 202 [2025-03-16 14:50:27,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:27,349 INFO L225 Difference]: With dead ends: 9964 [2025-03-16 14:50:27,350 INFO L226 Difference]: Without dead ends: 5451 [2025-03-16 14:50:27,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:27,354 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 180 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:27,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 344 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:50:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2025-03-16 14:50:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 5434. [2025-03-16 14:50:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5434 states, 5433 states have (on average 1.195472114853672) internal successors, (6495), 5433 states have internal predecessors, (6495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5434 states to 5434 states and 6495 transitions. [2025-03-16 14:50:27,415 INFO L78 Accepts]: Start accepts. Automaton has 5434 states and 6495 transitions. Word has length 202 [2025-03-16 14:50:27,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:27,415 INFO L471 AbstractCegarLoop]: Abstraction has 5434 states and 6495 transitions. [2025-03-16 14:50:27,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5434 states and 6495 transitions. [2025-03-16 14:50:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-16 14:50:27,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:27,417 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:27,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:50:27,417 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:27,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:27,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1648215562, now seen corresponding path program 1 times [2025-03-16 14:50:27,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:27,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382096092] [2025-03-16 14:50:27,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:27,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:27,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-16 14:50:27,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-16 14:50:27,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:27,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-16 14:50:27,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:27,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382096092] [2025-03-16 14:50:27,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382096092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:27,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:27,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:27,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903609910] [2025-03-16 14:50:27,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:27,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:27,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:27,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:27,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:27,541 INFO L87 Difference]: Start difference. First operand 5434 states and 6495 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:28,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:28,171 INFO L93 Difference]: Finished difference Result 11986 states and 14463 transitions. [2025-03-16 14:50:28,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:28,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 203 [2025-03-16 14:50:28,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:28,185 INFO L225 Difference]: With dead ends: 11986 [2025-03-16 14:50:28,185 INFO L226 Difference]: Without dead ends: 6553 [2025-03-16 14:50:28,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:28,190 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 175 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:28,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 377 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:28,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6553 states. [2025-03-16 14:50:28,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6553 to 6538. [2025-03-16 14:50:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6538 states, 6537 states have (on average 1.179899036255163) internal successors, (7713), 6537 states have internal predecessors, (7713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6538 states to 6538 states and 7713 transitions. [2025-03-16 14:50:28,259 INFO L78 Accepts]: Start accepts. Automaton has 6538 states and 7713 transitions. Word has length 203 [2025-03-16 14:50:28,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:28,259 INFO L471 AbstractCegarLoop]: Abstraction has 6538 states and 7713 transitions. [2025-03-16 14:50:28,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 6538 states and 7713 transitions. [2025-03-16 14:50:28,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-16 14:50:28,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:28,261 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:28,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:50:28,262 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:28,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash 501520068, now seen corresponding path program 1 times [2025-03-16 14:50:28,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:28,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952489380] [2025-03-16 14:50:28,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:28,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:28,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-16 14:50:28,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-16 14:50:28,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:28,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:28,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:28,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952489380] [2025-03-16 14:50:28,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952489380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:28,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:28,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:50:28,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648998170] [2025-03-16 14:50:28,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:28,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:50:28,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:28,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:50:28,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:28,522 INFO L87 Difference]: Start difference. First operand 6538 states and 7713 transitions. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:29,565 INFO L93 Difference]: Finished difference Result 20126 states and 24014 transitions. [2025-03-16 14:50:29,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:50:29,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 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 223 [2025-03-16 14:50:29,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:29,590 INFO L225 Difference]: With dead ends: 20126 [2025-03-16 14:50:29,590 INFO L226 Difference]: Without dead ends: 13589 [2025-03-16 14:50:29,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:29,599 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 313 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:29,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 207 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 14:50:29,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13589 states. [2025-03-16 14:50:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13589 to 11543. [2025-03-16 14:50:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11543 states, 11542 states have (on average 1.170854271356784) internal successors, (13514), 11542 states have internal predecessors, (13514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11543 states to 11543 states and 13514 transitions. [2025-03-16 14:50:29,736 INFO L78 Accepts]: Start accepts. Automaton has 11543 states and 13514 transitions. Word has length 223 [2025-03-16 14:50:29,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:29,736 INFO L471 AbstractCegarLoop]: Abstraction has 11543 states and 13514 transitions. [2025-03-16 14:50:29,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 11543 states and 13514 transitions. [2025-03-16 14:50:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-16 14:50:29,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:29,739 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:29,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:50:29,739 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:29,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1554595371, now seen corresponding path program 1 times [2025-03-16 14:50:29,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:29,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123822671] [2025-03-16 14:50:29,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:29,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:29,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-16 14:50:29,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-16 14:50:29,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:29,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:29,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:29,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123822671] [2025-03-16 14:50:29,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123822671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:29,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:29,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:50:29,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433738386] [2025-03-16 14:50:29,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:29,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:50:29,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:29,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:50:29,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:29,979 INFO L87 Difference]: Start difference. First operand 11543 states and 13514 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:31,022 INFO L93 Difference]: Finished difference Result 27897 states and 33094 transitions. [2025-03-16 14:50:31,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:50:31,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2025-03-16 14:50:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:31,049 INFO L225 Difference]: With dead ends: 27897 [2025-03-16 14:50:31,049 INFO L226 Difference]: Without dead ends: 16355 [2025-03-16 14:50:31,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:31,061 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 320 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:31,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 133 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 14:50:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16355 states. [2025-03-16 14:50:31,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16355 to 15968. [2025-03-16 14:50:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15968 states, 15967 states have (on average 1.1775537045155633) internal successors, (18802), 15967 states have internal predecessors, (18802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15968 states to 15968 states and 18802 transitions. [2025-03-16 14:50:31,277 INFO L78 Accepts]: Start accepts. Automaton has 15968 states and 18802 transitions. Word has length 233 [2025-03-16 14:50:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:31,277 INFO L471 AbstractCegarLoop]: Abstraction has 15968 states and 18802 transitions. [2025-03-16 14:50:31,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 15968 states and 18802 transitions. [2025-03-16 14:50:31,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-16 14:50:31,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:31,281 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:31,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:50:31,281 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:31,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2069619350, now seen corresponding path program 1 times [2025-03-16 14:50:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:31,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280206803] [2025-03-16 14:50:31,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:31,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-16 14:50:31,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-16 14:50:31,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:31,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 113 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:31,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280206803] [2025-03-16 14:50:31,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280206803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:50:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241755756] [2025-03-16 14:50:31,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:31,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:50:31,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:50:31,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:50:31,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:50:31,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-16 14:50:31,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-16 14:50:31,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:31,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:31,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 14:50:31,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:50:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 74 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:32,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:50:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 74 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:33,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241755756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:50:33,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:50:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-16 14:50:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142403483] [2025-03-16 14:50:33,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:50:33,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 14:50:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:33,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 14:50:33,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:50:33,513 INFO L87 Difference]: Start difference. First operand 15968 states and 18802 transitions. Second operand has 11 states, 11 states have (on average 34.27272727272727) internal successors, (377), 10 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:35,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:35,974 INFO L93 Difference]: Finished difference Result 32956 states and 39172 transitions. [2025-03-16 14:50:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 14:50:35,975 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 34.27272727272727) internal successors, (377), 10 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 235 [2025-03-16 14:50:35,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:35,997 INFO L225 Difference]: With dead ends: 32956 [2025-03-16 14:50:35,997 INFO L226 Difference]: Without dead ends: 16977 [2025-03-16 14:50:36,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2025-03-16 14:50:36,011 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1741 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4062 mSolverCounterSat, 700 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 4762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 700 IncrementalHoareTripleChecker+Valid, 4062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:36,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 111 Invalid, 4762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [700 Valid, 4062 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:50:36,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16977 states. [2025-03-16 14:50:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16977 to 15378. [2025-03-16 14:50:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15378 states, 15377 states have (on average 1.1591337712167522) internal successors, (17824), 15377 states have internal predecessors, (17824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15378 states to 15378 states and 17824 transitions. [2025-03-16 14:50:36,171 INFO L78 Accepts]: Start accepts. Automaton has 15378 states and 17824 transitions. Word has length 235 [2025-03-16 14:50:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:36,171 INFO L471 AbstractCegarLoop]: Abstraction has 15378 states and 17824 transitions. [2025-03-16 14:50:36,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.27272727272727) internal successors, (377), 10 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:36,171 INFO L276 IsEmpty]: Start isEmpty. Operand 15378 states and 17824 transitions. [2025-03-16 14:50:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-16 14:50:36,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:36,174 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:36,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:50:36,375 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,SelfDestructingSolverStorable11 [2025-03-16 14:50:36,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:36,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1301953367, now seen corresponding path program 1 times [2025-03-16 14:50:36,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:36,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629270649] [2025-03-16 14:50:36,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:36,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:36,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-16 14:50:36,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-16 14:50:36,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:36,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:36,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:36,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629270649] [2025-03-16 14:50:36,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629270649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:36,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:36,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:36,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474572567] [2025-03-16 14:50:36,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:36,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:50:36,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:36,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:50:36,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:36,636 INFO L87 Difference]: Start difference. First operand 15378 states and 17824 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:37,487 INFO L93 Difference]: Finished difference Result 29245 states and 33952 transitions. [2025-03-16 14:50:37,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:50:37,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2025-03-16 14:50:37,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:37,508 INFO L225 Difference]: With dead ends: 29245 [2025-03-16 14:50:37,509 INFO L226 Difference]: Without dead ends: 13500 [2025-03-16 14:50:37,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:37,521 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 195 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:37,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 149 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:50:37,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13500 states. [2025-03-16 14:50:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13500 to 11652. [2025-03-16 14:50:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11652 states, 11651 states have (on average 1.1146682688181273) internal successors, (12987), 11651 states have internal predecessors, (12987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11652 states to 11652 states and 12987 transitions. [2025-03-16 14:50:37,690 INFO L78 Accepts]: Start accepts. Automaton has 11652 states and 12987 transitions. Word has length 254 [2025-03-16 14:50:37,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:37,690 INFO L471 AbstractCegarLoop]: Abstraction has 11652 states and 12987 transitions. [2025-03-16 14:50:37,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 11652 states and 12987 transitions. [2025-03-16 14:50:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-16 14:50:37,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:37,697 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:37,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:50:37,697 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:37,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash 777587191, now seen corresponding path program 1 times [2025-03-16 14:50:37,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:37,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918787024] [2025-03-16 14:50:37,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:37,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:37,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-16 14:50:37,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-16 14:50:37,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:37,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:50:37,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:37,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918787024] [2025-03-16 14:50:37,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918787024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:37,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:37,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:50:37,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520042860] [2025-03-16 14:50:37,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:37,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:50:37,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:37,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:50:37,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:37,905 INFO L87 Difference]: Start difference. First operand 11652 states and 12987 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:38,835 INFO L93 Difference]: Finished difference Result 28285 states and 31518 transitions. [2025-03-16 14:50:38,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:50:38,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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 308 [2025-03-16 14:50:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:38,852 INFO L225 Difference]: With dead ends: 28285 [2025-03-16 14:50:38,853 INFO L226 Difference]: Without dead ends: 16450 [2025-03-16 14:50:38,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:38,861 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 340 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:38,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 68 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:50:38,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16450 states. [2025-03-16 14:50:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16450 to 15154. [2025-03-16 14:50:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15154 states, 15153 states have (on average 1.110935128357421) internal successors, (16834), 15153 states have internal predecessors, (16834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15154 states to 15154 states and 16834 transitions. [2025-03-16 14:50:39,006 INFO L78 Accepts]: Start accepts. Automaton has 15154 states and 16834 transitions. Word has length 308 [2025-03-16 14:50:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:39,007 INFO L471 AbstractCegarLoop]: Abstraction has 15154 states and 16834 transitions. [2025-03-16 14:50:39,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:39,007 INFO L276 IsEmpty]: Start isEmpty. Operand 15154 states and 16834 transitions. [2025-03-16 14:50:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-16 14:50:39,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:39,013 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:39,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:50:39,013 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:39,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:39,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1594637690, now seen corresponding path program 1 times [2025-03-16 14:50:39,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:39,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972021882] [2025-03-16 14:50:39,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:39,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:39,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-16 14:50:39,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-16 14:50:39,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:39,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 14:50:39,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:39,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972021882] [2025-03-16 14:50:39,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972021882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:39,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:39,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:39,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014915230] [2025-03-16 14:50:39,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:39,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:39,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:39,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:39,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:39,179 INFO L87 Difference]: Start difference. First operand 15154 states and 16834 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:39,666 INFO L93 Difference]: Finished difference Result 32156 states and 35741 transitions. [2025-03-16 14:50:39,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:39,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 319 [2025-03-16 14:50:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:39,684 INFO L225 Difference]: With dead ends: 32156 [2025-03-16 14:50:39,685 INFO L226 Difference]: Without dead ends: 17003 [2025-03-16 14:50:39,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:39,694 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 194 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:39,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 118 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:50:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17003 states. [2025-03-16 14:50:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17003 to 14966. [2025-03-16 14:50:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14966 states, 14965 states have (on average 1.1105245573003675) internal successors, (16619), 14965 states have internal predecessors, (16619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14966 states to 14966 states and 16619 transitions. [2025-03-16 14:50:39,879 INFO L78 Accepts]: Start accepts. Automaton has 14966 states and 16619 transitions. Word has length 319 [2025-03-16 14:50:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:39,879 INFO L471 AbstractCegarLoop]: Abstraction has 14966 states and 16619 transitions. [2025-03-16 14:50:39,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 14966 states and 16619 transitions. [2025-03-16 14:50:39,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-16 14:50:39,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:39,887 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:39,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:50:39,887 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:39,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash -778317318, now seen corresponding path program 1 times [2025-03-16 14:50:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:39,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899236535] [2025-03-16 14:50:39,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:39,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-16 14:50:39,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-16 14:50:39,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:39,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-16 14:50:40,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899236535] [2025-03-16 14:50:40,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899236535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:40,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:40,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:40,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840619682] [2025-03-16 14:50:40,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:40,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:40,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:40,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:40,041 INFO L87 Difference]: Start difference. First operand 14966 states and 16619 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:40,600 INFO L93 Difference]: Finished difference Result 30851 states and 34263 transitions. [2025-03-16 14:50:40,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:40,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 326 [2025-03-16 14:50:40,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:40,617 INFO L225 Difference]: With dead ends: 30851 [2025-03-16 14:50:40,617 INFO L226 Difference]: Without dead ends: 15886 [2025-03-16 14:50:40,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:40,627 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 189 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:40,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 109 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:50:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15886 states. [2025-03-16 14:50:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15886 to 14040. [2025-03-16 14:50:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14040 states, 14039 states have (on average 1.109338271956692) internal successors, (15574), 14039 states have internal predecessors, (15574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14040 states to 14040 states and 15574 transitions. [2025-03-16 14:50:40,750 INFO L78 Accepts]: Start accepts. Automaton has 14040 states and 15574 transitions. Word has length 326 [2025-03-16 14:50:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:40,751 INFO L471 AbstractCegarLoop]: Abstraction has 14040 states and 15574 transitions. [2025-03-16 14:50:40,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 14040 states and 15574 transitions. [2025-03-16 14:50:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-16 14:50:40,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:40,757 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:40,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:50:40,757 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:40,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1194742561, now seen corresponding path program 1 times [2025-03-16 14:50:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:40,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731412862] [2025-03-16 14:50:40,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:40,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:40,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-16 14:50:40,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 14:50:40,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:40,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:40,934 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-16 14:50:40,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:40,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731412862] [2025-03-16 14:50:40,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731412862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:40,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:40,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512375864] [2025-03-16 14:50:40,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:40,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:50:40,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:40,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:50:40,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:40,936 INFO L87 Difference]: Start difference. First operand 14040 states and 15574 transitions. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 3 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-16 14:50:41,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:41,681 INFO L93 Difference]: Finished difference Result 36555 states and 40479 transitions. [2025-03-16 14:50:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:50:41,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 3 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) Word has length 348 [2025-03-16 14:50:41,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:41,701 INFO L225 Difference]: With dead ends: 36555 [2025-03-16 14:50:41,701 INFO L226 Difference]: Without dead ends: 22148 [2025-03-16 14:50:41,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:41,713 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 199 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:41,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 55 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:50:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22148 states. [2025-03-16 14:50:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22148 to 21408. [2025-03-16 14:50:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21408 states, 21407 states have (on average 1.10543280235437) internal successors, (23664), 21407 states have internal predecessors, (23664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21408 states to 21408 states and 23664 transitions. [2025-03-16 14:50:41,951 INFO L78 Accepts]: Start accepts. Automaton has 21408 states and 23664 transitions. Word has length 348 [2025-03-16 14:50:41,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:41,951 INFO L471 AbstractCegarLoop]: Abstraction has 21408 states and 23664 transitions. [2025-03-16 14:50:41,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 3 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-16 14:50:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 21408 states and 23664 transitions. [2025-03-16 14:50:41,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-03-16 14:50:41,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:41,960 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:41,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:50:41,960 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:41,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash -830320302, now seen corresponding path program 1 times [2025-03-16 14:50:41,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:41,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190751549] [2025-03-16 14:50:41,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:41,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:41,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-03-16 14:50:41,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-03-16 14:50:41,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:41,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-16 14:50:42,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:42,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190751549] [2025-03-16 14:50:42,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190751549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:42,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:42,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:42,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731587293] [2025-03-16 14:50:42,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:42,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:42,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:42,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:42,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:42,094 INFO L87 Difference]: Start difference. First operand 21408 states and 23664 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:42,557 INFO L93 Difference]: Finished difference Result 42996 states and 47516 transitions. [2025-03-16 14:50:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:42,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 384 [2025-03-16 14:50:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:42,580 INFO L225 Difference]: With dead ends: 42996 [2025-03-16 14:50:42,580 INFO L226 Difference]: Without dead ends: 24535 [2025-03-16 14:50:42,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:42,592 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 196 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:42,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 127 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:50:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24535 states. [2025-03-16 14:50:42,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24535 to 15699. [2025-03-16 14:50:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15699 states, 15698 states have (on average 1.107529621607848) internal successors, (17386), 15698 states have internal predecessors, (17386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15699 states to 15699 states and 17386 transitions. [2025-03-16 14:50:42,842 INFO L78 Accepts]: Start accepts. Automaton has 15699 states and 17386 transitions. Word has length 384 [2025-03-16 14:50:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:42,842 INFO L471 AbstractCegarLoop]: Abstraction has 15699 states and 17386 transitions. [2025-03-16 14:50:42,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 15699 states and 17386 transitions. [2025-03-16 14:50:42,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-16 14:50:42,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:42,850 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:42,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:50:42,851 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:42,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:42,851 INFO L85 PathProgramCache]: Analyzing trace with hash 967576416, now seen corresponding path program 1 times [2025-03-16 14:50:42,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:42,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116281157] [2025-03-16 14:50:42,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:42,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:42,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-16 14:50:42,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-16 14:50:42,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:42,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-16 14:50:43,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:43,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116281157] [2025-03-16 14:50:43,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116281157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:43,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:43,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:43,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096863668] [2025-03-16 14:50:43,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:43,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:50:43,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:43,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:50:43,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:43,271 INFO L87 Difference]: Start difference. First operand 15699 states and 17386 transitions. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:43,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:43,890 INFO L93 Difference]: Finished difference Result 32319 states and 35721 transitions. [2025-03-16 14:50:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:50:43,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 437 [2025-03-16 14:50:43,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:43,907 INFO L225 Difference]: With dead ends: 32319 [2025-03-16 14:50:43,907 INFO L226 Difference]: Without dead ends: 16621 [2025-03-16 14:50:43,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:43,916 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 205 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:43,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 136 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:50:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16621 states. [2025-03-16 14:50:44,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16621 to 14963. [2025-03-16 14:50:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14963 states, 14962 states have (on average 1.1053335115626253) internal successors, (16538), 14962 states have internal predecessors, (16538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14963 states to 14963 states and 16538 transitions. [2025-03-16 14:50:44,106 INFO L78 Accepts]: Start accepts. Automaton has 14963 states and 16538 transitions. Word has length 437 [2025-03-16 14:50:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:44,106 INFO L471 AbstractCegarLoop]: Abstraction has 14963 states and 16538 transitions. [2025-03-16 14:50:44,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 14963 states and 16538 transitions. [2025-03-16 14:50:44,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-03-16 14:50:44,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:44,119 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:44,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:50:44,119 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:44,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:44,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1704020785, now seen corresponding path program 1 times [2025-03-16 14:50:44,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:44,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059995162] [2025-03-16 14:50:44,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:44,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:44,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-03-16 14:50:44,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-03-16 14:50:44,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:44,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-16 14:50:44,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:44,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059995162] [2025-03-16 14:50:44,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059995162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:44,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:44,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 14:50:44,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178108181] [2025-03-16 14:50:44,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:44,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:50:44,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:44,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:50:44,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:50:44,674 INFO L87 Difference]: Start difference. First operand 14963 states and 16538 transitions. Second operand has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:45,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:45,845 INFO L93 Difference]: Finished difference Result 36020 states and 39754 transitions. [2025-03-16 14:50:45,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:50:45,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 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 486 [2025-03-16 14:50:45,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:45,864 INFO L225 Difference]: With dead ends: 36020 [2025-03-16 14:50:45,865 INFO L226 Difference]: Without dead ends: 20874 [2025-03-16 14:50:45,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:50:45,874 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 372 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:45,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 101 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 1806 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 14:50:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20874 states. [2025-03-16 14:50:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20874 to 16802. [2025-03-16 14:50:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16802 states, 16801 states have (on average 1.1001130885066366) internal successors, (18483), 16801 states have internal predecessors, (18483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 18483 transitions. [2025-03-16 14:50:46,026 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 18483 transitions. Word has length 486 [2025-03-16 14:50:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:46,026 INFO L471 AbstractCegarLoop]: Abstraction has 16802 states and 18483 transitions. [2025-03-16 14:50:46,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 18483 transitions. [2025-03-16 14:50:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-03-16 14:50:46,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:46,036 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:46,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 14:50:46,036 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:46,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash -795446255, now seen corresponding path program 1 times [2025-03-16 14:50:46,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:46,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33882732] [2025-03-16 14:50:46,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:46,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:46,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-03-16 14:50:46,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-03-16 14:50:46,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:46,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:46,459 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-16 14:50:46,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:46,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33882732] [2025-03-16 14:50:46,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33882732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:46,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:46,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 14:50:46,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354930253] [2025-03-16 14:50:46,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:46,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:50:46,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:46,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:50:46,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:50:46,460 INFO L87 Difference]: Start difference. First operand 16802 states and 18483 transitions. Second operand has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:47,462 INFO L93 Difference]: Finished difference Result 35453 states and 38939 transitions. [2025-03-16 14:50:47,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:50:47,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 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 490 [2025-03-16 14:50:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:47,479 INFO L225 Difference]: With dead ends: 35453 [2025-03-16 14:50:47,479 INFO L226 Difference]: Without dead ends: 18468 [2025-03-16 14:50:47,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:50:47,490 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 384 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:47,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 63 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:50:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18468 states. [2025-03-16 14:50:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18468 to 11639. [2025-03-16 14:50:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11639 states, 11638 states have (on average 1.098814229249012) internal successors, (12788), 11638 states have internal predecessors, (12788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11639 states to 11639 states and 12788 transitions. [2025-03-16 14:50:47,618 INFO L78 Accepts]: Start accepts. Automaton has 11639 states and 12788 transitions. Word has length 490 [2025-03-16 14:50:47,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:47,618 INFO L471 AbstractCegarLoop]: Abstraction has 11639 states and 12788 transitions. [2025-03-16 14:50:47,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 11639 states and 12788 transitions. [2025-03-16 14:50:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2025-03-16 14:50:47,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:47,629 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:47,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 14:50:47,629 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:47,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:47,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2041851981, now seen corresponding path program 1 times [2025-03-16 14:50:47,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:47,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511542982] [2025-03-16 14:50:47,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:47,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:47,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 588 statements into 1 equivalence classes. [2025-03-16 14:50:47,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-03-16 14:50:47,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:47,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2025-03-16 14:50:47,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:47,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511542982] [2025-03-16 14:50:47,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511542982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:47,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:47,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:47,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119345754] [2025-03-16 14:50:47,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:47,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:47,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:47,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:47,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:47,827 INFO L87 Difference]: Start difference. First operand 11639 states and 12788 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:48,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:48,288 INFO L93 Difference]: Finished difference Result 25116 states and 27528 transitions. [2025-03-16 14:50:48,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:48,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 588 [2025-03-16 14:50:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:48,302 INFO L225 Difference]: With dead ends: 25116 [2025-03-16 14:50:48,302 INFO L226 Difference]: Without dead ends: 12004 [2025-03-16 14:50:48,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:48,311 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 192 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:48,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 319 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:50:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12004 states. [2025-03-16 14:50:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12004 to 11820. [2025-03-16 14:50:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11820 states, 11819 states have (on average 1.082578898383958) internal successors, (12795), 11819 states have internal predecessors, (12795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11820 states to 11820 states and 12795 transitions. [2025-03-16 14:50:48,408 INFO L78 Accepts]: Start accepts. Automaton has 11820 states and 12795 transitions. Word has length 588 [2025-03-16 14:50:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:48,408 INFO L471 AbstractCegarLoop]: Abstraction has 11820 states and 12795 transitions. [2025-03-16 14:50:48,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 11820 states and 12795 transitions. [2025-03-16 14:50:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-03-16 14:50:48,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:48,417 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:48,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 14:50:48,418 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:48,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash -235136431, now seen corresponding path program 1 times [2025-03-16 14:50:48,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:48,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741176920] [2025-03-16 14:50:48,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:48,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:48,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-03-16 14:50:48,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-03-16 14:50:48,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:48,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 948 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2025-03-16 14:50:48,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:48,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741176920] [2025-03-16 14:50:48,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741176920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:48,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:48,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:48,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794658410] [2025-03-16 14:50:48,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:48,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:48,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:48,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:48,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:48,626 INFO L87 Difference]: Start difference. First operand 11820 states and 12795 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:49,044 INFO L93 Difference]: Finished difference Result 24003 states and 25953 transitions. [2025-03-16 14:50:49,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:49,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 702 [2025-03-16 14:50:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:49,045 INFO L225 Difference]: With dead ends: 24003 [2025-03-16 14:50:49,045 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:50:49,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:49,050 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 60 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:49,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 92 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:50:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:50:49,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:50:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:50:49,051 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 702 [2025-03-16 14:50:49,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:49,051 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:50:49,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:50:49,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:50:49,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:50:49,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 14:50:49,056 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:49,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:50:54,947 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:50:54,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:50:54 BoogieIcfgContainer [2025-03-16 14:50:54,969 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:50:54,970 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:50:54,970 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:50:54,970 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:50:54,971 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:50:20" (3/4) ... [2025-03-16 14:50:54,972 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:50:54,989 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:50:54,990 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:50:54,991 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:50:54,991 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:50:55,101 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:50:55,101 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:50:55,101 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:50:55,103 INFO L158 Benchmark]: Toolchain (without parser) took 36421.41ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 126.8MB in the beginning and 443.3MB in the end (delta: -316.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-03-16 14:50:55,104 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 192.9MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:50:55,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.48ms. Allocated memory is still 167.8MB. Free memory was 126.8MB in the beginning and 84.0MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 14:50:55,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.39ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 67.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:50:55,106 INFO L158 Benchmark]: Boogie Preprocessor took 123.97ms. Allocated memory is still 167.8MB. Free memory was 67.1MB in the beginning and 43.7MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:50:55,106 INFO L158 Benchmark]: IcfgBuilder took 1250.74ms. Allocated memory is still 167.8MB. Free memory was 43.7MB in the beginning and 109.1MB in the end (delta: -65.4MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-03-16 14:50:55,106 INFO L158 Benchmark]: TraceAbstraction took 34406.21ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 109.1MB in the beginning and 459.9MB in the end (delta: -350.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-16 14:50:55,106 INFO L158 Benchmark]: Witness Printer took 131.65ms. Allocated memory is still 1.5GB. Free memory was 459.9MB in the beginning and 443.3MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:50:55,107 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 192.9MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.48ms. Allocated memory is still 167.8MB. Free memory was 126.8MB in the beginning and 84.0MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.39ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 67.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.97ms. Allocated memory is still 167.8MB. Free memory was 67.1MB in the beginning and 43.7MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1250.74ms. Allocated memory is still 167.8MB. Free memory was 43.7MB in the beginning and 109.1MB in the end (delta: -65.4MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34406.21ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 109.1MB in the beginning and 459.9MB in the end (delta: -350.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 131.65ms. Allocated memory is still 1.5GB. Free memory was 459.9MB in the beginning and 443.3MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 82]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 222 locations, 420 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.4s, OverallIterations: 23, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6527 SdHoareTripleChecker+Valid, 16.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6527 mSDsluCounter, 4162 SdHoareTripleChecker+Invalid, 13.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 645 mSDsCounter, 3274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20827 IncrementalHoareTripleChecker+Invalid, 24101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3274 mSolverCounterUnsat, 3517 mSDtfsCounter, 20827 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21408occurred in iteration=17, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 33635 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 6676 NumberOfCodeBlocks, 6676 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 6886 ConstructedInterpolants, 0 QuantifiedInterpolants, 19710 SizeOfPredicates, 8 NumberOfNonLiveVariables, 348 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 25 InterpolantComputations, 22 PerfectInterpolantSequences, 6710/6824 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((long long) a29 + 21) <= 0) && (a4 == 0)) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && ((a25 == 13) || (a25 == 12))) || ((((((a29 <= 384312) && (278 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && ((a25 == 13) || (a25 == 12)))) || (((((((a25 == 11) && (a3 == 1)) && (a4 == 1)) && (214883 <= a29)) && (a8 == 15)) || (((((278 <= a29) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) && (a29 <= 599999))) || ((((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((((((a29 <= 140) && (a4 == 0)) && (a25 <= 10)) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((((a25 == 11) && (a29 <= 571720)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a29 <= 384312) && (307 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && ((a25 == 13) || (a25 == 12)))) || ((((((((long long) a23 + 43) <= 0) && (a3 == 1)) && (a4 == 1)) && (214883 <= a29)) && (a8 == 15)) && (a25 == 10))) || (((((((a4 == 0) && (a25 == 11)) && (278 <= a29)) && (a29 <= 599999)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((((a29 <= 245) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && ((a25 == 13) || (a25 == 12)))) || ((((((((long long) a29 + 21) <= 0) && (a4 == 0)) && (a25 == 9)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((((a29 <= 275) && (a25 == 12)) && (a4 == 0)) && (a3 == 1)) && (a8 == 15))) || ((((a23 <= 138) && (a4 == 1)) && (((((278 <= a29) && (a25 == 9)) && (a3 == 1)) && (a8 == 15)) || (((a25 == 11) && (a3 == 1)) && (a8 == 15)))) && (0 <= ((long long) a23 + 42)))) || (((((a29 <= 384312) && (a25 == 9)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a25 <= 10) && (a29 <= 245)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((((long long) 28300 + a29) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a3 == 1)) && (a8 == 15)) && (a25 != 9))) || ((((((a29 <= 384312) && (307 <= a23)) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((long long) a23 + 599772) <= 0) && ((((((a25 == 11) && (a3 == 1)) && (a4 == 1)) && (214883 <= a29)) && (a8 == 15)) || (((((278 <= a29) && (a25 == 9)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))))) || (((((((a29 <= 384312) && (a4 == 0)) && (278 <= a29)) && (a25 == 9)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:50:55,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE