./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label08.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 8bb11b03e1d6962fa6d12d5d93aa1dd97aef360b3e232443e9b2cf50f9d87a21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:49:18,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:49:18,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:49:18,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:49:18,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:49:18,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:49:18,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:49:18,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:49:18,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:49:18,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:49:18,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:49:18,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:49:18,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:49:18,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:49:18,178 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:49:18,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:49:18,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:49:18,179 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:49:18,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:49:18,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:49:18,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:49:18,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:49:18,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:49:18,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:49:18,180 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:49:18,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:49:18,180 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:49:18,180 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:49:18,180 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:49:18,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:49:18,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:49:18,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:49:18,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:49:18,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:49:18,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:49:18,181 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:49:18,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:49:18,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:49:18,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:49:18,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:49:18,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:49:18,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:49:18,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:49:18,181 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 -> 8bb11b03e1d6962fa6d12d5d93aa1dd97aef360b3e232443e9b2cf50f9d87a21 [2025-03-03 10:49:18,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:49:18,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:49:18,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:49:18,424 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:49:18,424 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:49:18,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label08.c [2025-03-03 10:49:19,579 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7925df4ca/ad4b5e26fdd14d8283c4da13f4f5ad37/FLAG283ecc7da [2025-03-03 10:49:19,918 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:49:19,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label08.c [2025-03-03 10:49:19,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7925df4ca/ad4b5e26fdd14d8283c4da13f4f5ad37/FLAG283ecc7da [2025-03-03 10:49:20,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7925df4ca/ad4b5e26fdd14d8283c4da13f4f5ad37 [2025-03-03 10:49:20,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:49:20,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:49:20,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:49:20,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:49:20,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:49:20,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:49:20" (1/1) ... [2025-03-03 10:49:20,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7edbcd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20, skipping insertion in model container [2025-03-03 10:49:20,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:49:20" (1/1) ... [2025-03-03 10:49:20,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:49:20,343 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/Problem15_label08.c[6299,6312] [2025-03-03 10:49:20,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:49:20,583 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:49:20,599 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/Problem15_label08.c[6299,6312] [2025-03-03 10:49:20,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:49:20,725 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:49:20,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20 WrapperNode [2025-03-03 10:49:20,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:49:20,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:49:20,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:49:20,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:49:20,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20" (1/1) ... [2025-03-03 10:49:20,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20" (1/1) ... [2025-03-03 10:49:20,895 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-03 10:49:20,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:49:20,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:49:20,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:49:20,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:49:20,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20" (1/1) ... [2025-03-03 10:49:20,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20" (1/1) ... [2025-03-03 10:49:20,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20" (1/1) ... [2025-03-03 10:49:21,011 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:49:21,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20" (1/1) ... [2025-03-03 10:49:21,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20" (1/1) ... [2025-03-03 10:49:21,065 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20" (1/1) ... [2025-03-03 10:49:21,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20" (1/1) ... [2025-03-03 10:49:21,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20" (1/1) ... [2025-03-03 10:49:21,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20" (1/1) ... [2025-03-03 10:49:21,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:49:21,122 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:49:21,122 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:49:21,122 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:49:21,123 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20" (1/1) ... [2025-03-03 10:49:21,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:49:21,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:21,149 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:49:21,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:49:21,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:49:21,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:49:21,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:49:21,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:49:21,224 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:49:21,226 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:49:23,160 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-03 10:49:23,273 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-03 10:49:23,274 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:49:23,293 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:49:23,293 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:49:23,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:23 BoogieIcfgContainer [2025-03-03 10:49:23,294 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:49:23,295 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:49:23,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:49:23,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:49:23,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:49:20" (1/3) ... [2025-03-03 10:49:23,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a54ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:49:23, skipping insertion in model container [2025-03-03 10:49:23,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:20" (2/3) ... [2025-03-03 10:49:23,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a54ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:49:23, skipping insertion in model container [2025-03-03 10:49:23,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:23" (3/3) ... [2025-03-03 10:49:23,300 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label08.c [2025-03-03 10:49:23,310 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:49:23,311 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label08.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:49:23,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:49:23,369 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;@6f17032a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:49:23,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:49:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 10:49:23,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:23,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:23,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:23,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash -823800172, now seen corresponding path program 1 times [2025-03-03 10:49:23,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:23,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546085148] [2025-03-03 10:49:23,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:23,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:23,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 10:49:23,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 10:49:23,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:23,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:23,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:23,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546085148] [2025-03-03 10:49:23,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546085148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:23,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:23,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:23,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423620608] [2025-03-03 10:49:23,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:23,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:23,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:23,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:23,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:23,732 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:25,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:25,033 INFO L93 Difference]: Finished difference Result 1155 states and 2103 transitions. [2025-03-03 10:49:25,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:25,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-03 10:49:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:25,049 INFO L225 Difference]: With dead ends: 1155 [2025-03-03 10:49:25,050 INFO L226 Difference]: Without dead ends: 667 [2025-03-03 10:49:25,055 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-03 10:49:25,058 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 293 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:25,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 370 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:49:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-03 10:49:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2025-03-03 10:49:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2025-03-03 10:49:25,107 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 51 [2025-03-03 10:49:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:25,108 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2025-03-03 10:49:25,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2025-03-03 10:49:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 10:49:25,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:25,111 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:49:25,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:49:25,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:25,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash -80269939, now seen corresponding path program 1 times [2025-03-03 10:49:25,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:25,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174380728] [2025-03-03 10:49:25,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:25,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:25,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 10:49:25,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 10:49:25,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:25,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:25,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:25,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174380728] [2025-03-03 10:49:25,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174380728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:25,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:25,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:25,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934419729] [2025-03-03 10:49:25,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:25,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:25,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:25,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:25,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:25,327 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:26,574 INFO L93 Difference]: Finished difference Result 1955 states and 2894 transitions. [2025-03-03 10:49:26,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:26,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-03 10:49:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:26,579 INFO L225 Difference]: With dead ends: 1955 [2025-03-03 10:49:26,579 INFO L226 Difference]: Without dead ends: 1292 [2025-03-03 10:49:26,581 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-03 10:49:26,581 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:26,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 325 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:49:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-03-03 10:49:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1282. [2025-03-03 10:49:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 1.3989071038251366) internal successors, (1792), 1281 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1792 transitions. [2025-03-03 10:49:26,608 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1792 transitions. Word has length 126 [2025-03-03 10:49:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:26,609 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1792 transitions. [2025-03-03 10:49:26,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1792 transitions. [2025-03-03 10:49:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 10:49:26,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:26,612 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:49:26,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:49:26,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:26,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1008623959, now seen corresponding path program 1 times [2025-03-03 10:49:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:26,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463880173] [2025-03-03 10:49:26,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:26,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:26,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 10:49:26,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 10:49:26,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:26,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:26,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:26,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463880173] [2025-03-03 10:49:26,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463880173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:26,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:26,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:26,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058575116] [2025-03-03 10:49:26,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:26,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:26,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:26,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:26,722 INFO L87 Difference]: Start difference. First operand 1282 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:27,897 INFO L93 Difference]: Finished difference Result 3766 states and 5264 transitions. [2025-03-03 10:49:27,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:27,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-03-03 10:49:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:27,905 INFO L225 Difference]: With dead ends: 3766 [2025-03-03 10:49:27,905 INFO L226 Difference]: Without dead ends: 2486 [2025-03-03 10:49:27,906 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-03 10:49:27,907 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 271 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:27,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 338 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-03-03 10:49:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2182. [2025-03-03 10:49:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2181 states have (on average 1.2824392480513527) internal successors, (2797), 2181 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2797 transitions. [2025-03-03 10:49:27,941 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2797 transitions. Word has length 130 [2025-03-03 10:49:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:27,942 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 2797 transitions. [2025-03-03 10:49:27,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2797 transitions. [2025-03-03 10:49:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-03 10:49:27,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:27,951 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:27,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:49:27,952 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:27,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:27,952 INFO L85 PathProgramCache]: Analyzing trace with hash 252646878, now seen corresponding path program 1 times [2025-03-03 10:49:27,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:27,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246925030] [2025-03-03 10:49:27,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:27,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-03 10:49:28,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-03 10:49:28,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:28,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 10:49:28,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:28,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246925030] [2025-03-03 10:49:28,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246925030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:28,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:28,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:28,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695645930] [2025-03-03 10:49:28,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:28,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:28,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:28,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:28,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:28,233 INFO L87 Difference]: Start difference. First operand 2182 states and 2797 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:29,382 INFO L93 Difference]: Finished difference Result 5865 states and 7583 transitions. [2025-03-03 10:49:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:29,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 247 [2025-03-03 10:49:29,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:29,393 INFO L225 Difference]: With dead ends: 5865 [2025-03-03 10:49:29,393 INFO L226 Difference]: Without dead ends: 3685 [2025-03-03 10:49:29,395 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-03 10:49:29,396 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 117 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:29,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 319 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:29,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2025-03-03 10:49:29,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3682. [2025-03-03 10:49:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3681 states have (on average 1.2200488997555012) internal successors, (4491), 3681 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4491 transitions. [2025-03-03 10:49:29,445 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4491 transitions. Word has length 247 [2025-03-03 10:49:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:29,446 INFO L471 AbstractCegarLoop]: Abstraction has 3682 states and 4491 transitions. [2025-03-03 10:49:29,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4491 transitions. [2025-03-03 10:49:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-03 10:49:29,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:29,449 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:29,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:49:29,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:29,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:29,450 INFO L85 PathProgramCache]: Analyzing trace with hash -142896013, now seen corresponding path program 1 times [2025-03-03 10:49:29,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:29,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223223219] [2025-03-03 10:49:29,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:29,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:29,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-03 10:49:29,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-03 10:49:29,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:29,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 10:49:29,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:29,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223223219] [2025-03-03 10:49:29,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223223219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:29,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:29,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:29,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708535637] [2025-03-03 10:49:29,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:29,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:29,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:29,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:29,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:29,956 INFO L87 Difference]: Start difference. First operand 3682 states and 4491 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:30,887 INFO L93 Difference]: Finished difference Result 7661 states and 9291 transitions. [2025-03-03 10:49:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:30,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 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 323 [2025-03-03 10:49:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:30,896 INFO L225 Difference]: With dead ends: 7661 [2025-03-03 10:49:30,896 INFO L226 Difference]: Without dead ends: 3981 [2025-03-03 10:49:30,900 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-03 10:49:30,901 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:30,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:49:30,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2025-03-03 10:49:30,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2025-03-03 10:49:30,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3980 states have (on average 1.2050251256281408) internal successors, (4796), 3980 states have internal predecessors, (4796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4796 transitions. [2025-03-03 10:49:30,967 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 4796 transitions. Word has length 323 [2025-03-03 10:49:30,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:30,968 INFO L471 AbstractCegarLoop]: Abstraction has 3981 states and 4796 transitions. [2025-03-03 10:49:30,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 4796 transitions. [2025-03-03 10:49:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-03 10:49:30,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:30,972 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:30,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:49:30,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:30,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1674655228, now seen corresponding path program 1 times [2025-03-03 10:49:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:30,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260209586] [2025-03-03 10:49:30,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:31,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 10:49:31,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 10:49:31,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:31,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 10:49:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:31,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260209586] [2025-03-03 10:49:31,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260209586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:31,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:31,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:31,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259185434] [2025-03-03 10:49:31,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:31,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:31,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:31,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:31,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:31,211 INFO L87 Difference]: Start difference. First operand 3981 states and 4796 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:32,387 INFO L93 Difference]: Finished difference Result 8857 states and 10953 transitions. [2025-03-03 10:49:32,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:32,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 338 [2025-03-03 10:49:32,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:32,399 INFO L225 Difference]: With dead ends: 8857 [2025-03-03 10:49:32,399 INFO L226 Difference]: Without dead ends: 5177 [2025-03-03 10:49:32,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:32,403 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 264 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:32,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 324 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:32,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5177 states. [2025-03-03 10:49:32,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5177 to 3678. [2025-03-03 10:49:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 3677 states have (on average 1.2181125917867828) internal successors, (4479), 3677 states have internal predecessors, (4479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4479 transitions. [2025-03-03 10:49:32,451 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4479 transitions. Word has length 338 [2025-03-03 10:49:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:32,452 INFO L471 AbstractCegarLoop]: Abstraction has 3678 states and 4479 transitions. [2025-03-03 10:49:32,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4479 transitions. [2025-03-03 10:49:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-03-03 10:49:32,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:32,457 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:32,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:49:32,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:32,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:32,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1310816607, now seen corresponding path program 1 times [2025-03-03 10:49:32,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:32,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593975647] [2025-03-03 10:49:32,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:32,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:32,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-03-03 10:49:32,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-03-03 10:49:32,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:32,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:49:32,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:32,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593975647] [2025-03-03 10:49:32,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593975647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:32,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:32,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:32,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047640208] [2025-03-03 10:49:32,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:32,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:32,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:32,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:32,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:32,707 INFO L87 Difference]: Start difference. First operand 3678 states and 4479 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:33,820 INFO L93 Difference]: Finished difference Result 9157 states and 11369 transitions. [2025-03-03 10:49:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:33,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 397 [2025-03-03 10:49:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:33,832 INFO L225 Difference]: With dead ends: 9157 [2025-03-03 10:49:33,832 INFO L226 Difference]: Without dead ends: 5780 [2025-03-03 10:49:33,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:33,836 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 277 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:33,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 636 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5780 states. [2025-03-03 10:49:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5780 to 5182. [2025-03-03 10:49:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5182 states, 5181 states have (on average 1.1767998455896544) internal successors, (6097), 5181 states have internal predecessors, (6097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5182 states to 5182 states and 6097 transitions. [2025-03-03 10:49:33,901 INFO L78 Accepts]: Start accepts. Automaton has 5182 states and 6097 transitions. Word has length 397 [2025-03-03 10:49:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:33,901 INFO L471 AbstractCegarLoop]: Abstraction has 5182 states and 6097 transitions. [2025-03-03 10:49:33,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 5182 states and 6097 transitions. [2025-03-03 10:49:33,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-03 10:49:33,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:33,905 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:33,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:49:33,906 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:33,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:33,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1774037607, now seen corresponding path program 1 times [2025-03-03 10:49:33,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:33,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794363718] [2025-03-03 10:49:33,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:33,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:33,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-03 10:49:33,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-03 10:49:33,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:33,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:34,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:34,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794363718] [2025-03-03 10:49:34,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794363718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:34,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:34,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:34,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112557453] [2025-03-03 10:49:34,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:34,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:34,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:34,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:34,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:34,138 INFO L87 Difference]: Start difference. First operand 5182 states and 6097 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-03 10:49:35,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:35,082 INFO L93 Difference]: Finished difference Result 11868 states and 14277 transitions. [2025-03-03 10:49:35,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:35,083 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 403 [2025-03-03 10:49:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:35,097 INFO L225 Difference]: With dead ends: 11868 [2025-03-03 10:49:35,098 INFO L226 Difference]: Without dead ends: 6987 [2025-03-03 10:49:35,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:35,102 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 248 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:35,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 604 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:49:35,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6987 states. [2025-03-03 10:49:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6987 to 6087. [2025-03-03 10:49:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6087 states, 6086 states have (on average 1.1628327308577062) internal successors, (7077), 6086 states have internal predecessors, (7077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6087 states to 6087 states and 7077 transitions. [2025-03-03 10:49:35,170 INFO L78 Accepts]: Start accepts. Automaton has 6087 states and 7077 transitions. Word has length 403 [2025-03-03 10:49:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:35,170 INFO L471 AbstractCegarLoop]: Abstraction has 6087 states and 7077 transitions. [2025-03-03 10:49:35,174 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-03 10:49:35,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6087 states and 7077 transitions. [2025-03-03 10:49:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-03-03 10:49:35,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:35,177 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:35,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:49:35,177 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:35,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:35,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1530255443, now seen corresponding path program 1 times [2025-03-03 10:49:35,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:35,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280484000] [2025-03-03 10:49:35,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:35,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:35,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-03 10:49:35,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-03 10:49:35,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:35,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 10:49:35,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:35,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280484000] [2025-03-03 10:49:35,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280484000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:35,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:35,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:35,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331212079] [2025-03-03 10:49:35,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:35,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:35,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:35,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:35,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:35,464 INFO L87 Difference]: Start difference. First operand 6087 states and 7077 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:36,403 INFO L93 Difference]: Finished difference Result 13667 states and 16224 transitions. [2025-03-03 10:49:36,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:36,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 420 [2025-03-03 10:49:36,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:36,420 INFO L225 Difference]: With dead ends: 13667 [2025-03-03 10:49:36,420 INFO L226 Difference]: Without dead ends: 7881 [2025-03-03 10:49:36,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:36,425 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:36,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 617 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:49:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7881 states. [2025-03-03 10:49:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7881 to 7877. [2025-03-03 10:49:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7877 states, 7876 states have (on average 1.1457592686642966) internal successors, (9024), 7876 states have internal predecessors, (9024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7877 states to 7877 states and 9024 transitions. [2025-03-03 10:49:36,491 INFO L78 Accepts]: Start accepts. Automaton has 7877 states and 9024 transitions. Word has length 420 [2025-03-03 10:49:36,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:36,491 INFO L471 AbstractCegarLoop]: Abstraction has 7877 states and 9024 transitions. [2025-03-03 10:49:36,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 7877 states and 9024 transitions. [2025-03-03 10:49:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-03 10:49:36,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:36,494 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:36,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:49:36,494 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:36,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 607795535, now seen corresponding path program 1 times [2025-03-03 10:49:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:36,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483077393] [2025-03-03 10:49:36,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:36,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:36,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-03 10:49:36,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-03 10:49:36,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:36,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 49 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:36,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:36,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483077393] [2025-03-03 10:49:36,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483077393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:36,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374320312] [2025-03-03 10:49:36,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:36,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:36,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:36,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:49:36,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:49:36,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-03 10:49:37,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-03 10:49:37,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:37,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:37,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:49:37,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:49:37,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:49:37,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374320312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:37,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:49:37,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:49:37,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765589618] [2025-03-03 10:49:37,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:37,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:37,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:37,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:37,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:49:37,201 INFO L87 Difference]: Start difference. First operand 7877 states and 9024 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:38,300 INFO L93 Difference]: Finished difference Result 18510 states and 21585 transitions. [2025-03-03 10:49:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:38,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 428 [2025-03-03 10:49:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:38,316 INFO L225 Difference]: With dead ends: 18510 [2025-03-03 10:49:38,316 INFO L226 Difference]: Without dead ends: 10934 [2025-03-03 10:49:38,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:49:38,324 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 364 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:38,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 636 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:49:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2025-03-03 10:49:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 10928. [2025-03-03 10:49:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10928 states, 10927 states have (on average 1.1586894847625149) internal successors, (12661), 10927 states have internal predecessors, (12661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10928 states to 10928 states and 12661 transitions. [2025-03-03 10:49:38,412 INFO L78 Accepts]: Start accepts. Automaton has 10928 states and 12661 transitions. Word has length 428 [2025-03-03 10:49:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:38,413 INFO L471 AbstractCegarLoop]: Abstraction has 10928 states and 12661 transitions. [2025-03-03 10:49:38,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 10928 states and 12661 transitions. [2025-03-03 10:49:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-03 10:49:38,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:38,416 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:38,422 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-03 10:49:38,616 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,SelfDestructingSolverStorable9 [2025-03-03 10:49:38,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:38,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1082301658, now seen corresponding path program 1 times [2025-03-03 10:49:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:38,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939087117] [2025-03-03 10:49:38,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:38,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:38,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-03 10:49:38,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-03 10:49:38,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:38,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:49:38,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:38,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939087117] [2025-03-03 10:49:38,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939087117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:38,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:38,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:38,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888343737] [2025-03-03 10:49:38,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:38,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:38,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:38,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:38,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:38,899 INFO L87 Difference]: Start difference. First operand 10928 states and 12661 transitions. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:40,023 INFO L93 Difference]: Finished difference Result 28431 states and 33049 transitions. [2025-03-03 10:49:40,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:40,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 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 500 [2025-03-03 10:49:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:40,053 INFO L225 Difference]: With dead ends: 28431 [2025-03-03 10:49:40,054 INFO L226 Difference]: Without dead ends: 17804 [2025-03-03 10:49:40,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:40,066 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 306 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:40,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 174 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:49:40,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17804 states. [2025-03-03 10:49:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17804 to 16010. [2025-03-03 10:49:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16010 states, 16009 states have (on average 1.1511649697045412) internal successors, (18429), 16009 states have internal predecessors, (18429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16010 states to 16010 states and 18429 transitions. [2025-03-03 10:49:40,243 INFO L78 Accepts]: Start accepts. Automaton has 16010 states and 18429 transitions. Word has length 500 [2025-03-03 10:49:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:40,244 INFO L471 AbstractCegarLoop]: Abstraction has 16010 states and 18429 transitions. [2025-03-03 10:49:40,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 16010 states and 18429 transitions. [2025-03-03 10:49:40,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-03 10:49:40,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:40,248 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:40,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:49:40,248 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:40,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1930007792, now seen corresponding path program 1 times [2025-03-03 10:49:40,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:40,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298587390] [2025-03-03 10:49:40,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:40,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:40,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-03 10:49:40,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-03 10:49:40,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:40,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-03 10:49:40,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:40,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298587390] [2025-03-03 10:49:40,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298587390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:40,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:40,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:40,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246373261] [2025-03-03 10:49:40,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:40,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:40,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:40,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:40,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:40,552 INFO L87 Difference]: Start difference. First operand 16010 states and 18429 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:41,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:41,664 INFO L93 Difference]: Finished difference Result 39517 states and 45917 transitions. [2025-03-03 10:49:41,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:41,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 539 [2025-03-03 10:49:41,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:41,698 INFO L225 Difference]: With dead ends: 39517 [2025-03-03 10:49:41,698 INFO L226 Difference]: Without dead ends: 23808 [2025-03-03 10:49:41,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:41,714 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:41,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 622 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:49:41,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23808 states. [2025-03-03 10:49:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23808 to 23190. [2025-03-03 10:49:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23190 states, 23189 states have (on average 1.1390314373194186) internal successors, (26413), 23189 states have internal predecessors, (26413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23190 states to 23190 states and 26413 transitions. [2025-03-03 10:49:41,985 INFO L78 Accepts]: Start accepts. Automaton has 23190 states and 26413 transitions. Word has length 539 [2025-03-03 10:49:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:41,986 INFO L471 AbstractCegarLoop]: Abstraction has 23190 states and 26413 transitions. [2025-03-03 10:49:41,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 23190 states and 26413 transitions. [2025-03-03 10:49:41,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-03 10:49:41,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:41,992 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:41,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:49:41,992 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:41,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1959981522, now seen corresponding path program 1 times [2025-03-03 10:49:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:41,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970168662] [2025-03-03 10:49:41,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:41,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:42,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-03 10:49:42,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-03 10:49:42,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:42,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 565 proven. 39 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-03-03 10:49:42,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:42,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970168662] [2025-03-03 10:49:42,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970168662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:42,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908256524] [2025-03-03 10:49:42,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:42,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:42,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:42,402 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:49:42,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:49:42,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-03 10:49:42,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-03 10:49:42,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:42,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:42,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:49:42,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2025-03-03 10:49:42,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:49:42,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908256524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:42,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:49:42,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:49:42,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292796252] [2025-03-03 10:49:42,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:42,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:42,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:42,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:42,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:49:42,621 INFO L87 Difference]: Start difference. First operand 23190 states and 26413 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:43,511 INFO L93 Difference]: Finished difference Result 49666 states and 56865 transitions. [2025-03-03 10:49:43,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:43,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 579 [2025-03-03 10:49:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:43,535 INFO L225 Difference]: With dead ends: 49666 [2025-03-03 10:49:43,535 INFO L226 Difference]: Without dead ends: 26777 [2025-03-03 10:49:43,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:49:43,551 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 364 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:43,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 445 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:49:43,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26777 states. [2025-03-03 10:49:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26777 to 19240. [2025-03-03 10:49:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19240 states, 19239 states have (on average 1.125526274754405) internal successors, (21654), 19239 states have internal predecessors, (21654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19240 states to 19240 states and 21654 transitions. [2025-03-03 10:49:43,811 INFO L78 Accepts]: Start accepts. Automaton has 19240 states and 21654 transitions. Word has length 579 [2025-03-03 10:49:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:43,811 INFO L471 AbstractCegarLoop]: Abstraction has 19240 states and 21654 transitions. [2025-03-03 10:49:43,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 19240 states and 21654 transitions. [2025-03-03 10:49:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2025-03-03 10:49:43,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:43,822 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-03 10:49:43,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:49:44,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 10:49:44,023 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:44,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:44,023 INFO L85 PathProgramCache]: Analyzing trace with hash 652416039, now seen corresponding path program 1 times [2025-03-03 10:49:44,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:44,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408215708] [2025-03-03 10:49:44,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:44,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:44,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-03-03 10:49:44,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-03-03 10:49:44,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:44,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 437 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:49:44,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:44,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408215708] [2025-03-03 10:49:44,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408215708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:44,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:44,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:44,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987328336] [2025-03-03 10:49:44,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:44,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:44,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:44,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:44,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:44,484 INFO L87 Difference]: Start difference. First operand 19240 states and 21654 transitions. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:45,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:45,895 INFO L93 Difference]: Finished difference Result 46852 states and 52873 transitions. [2025-03-03 10:49:45,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:45,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 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 613 [2025-03-03 10:49:45,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:45,915 INFO L225 Difference]: With dead ends: 46852 [2025-03-03 10:49:45,916 INFO L226 Difference]: Without dead ends: 24923 [2025-03-03 10:49:45,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:45,930 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 181 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:45,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 527 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:49:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24923 states. [2025-03-03 10:49:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24923 to 22232. [2025-03-03 10:49:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22232 states, 22231 states have (on average 1.082497413521659) internal successors, (24065), 22231 states have internal predecessors, (24065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22232 states to 22232 states and 24065 transitions. [2025-03-03 10:49:46,172 INFO L78 Accepts]: Start accepts. Automaton has 22232 states and 24065 transitions. Word has length 613 [2025-03-03 10:49:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:46,172 INFO L471 AbstractCegarLoop]: Abstraction has 22232 states and 24065 transitions. [2025-03-03 10:49:46,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 22232 states and 24065 transitions. [2025-03-03 10:49:46,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2025-03-03 10:49:46,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:46,183 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:49:46,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:49:46,183 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:46,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash -922435814, now seen corresponding path program 1 times [2025-03-03 10:49:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:46,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180781736] [2025-03-03 10:49:46,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:46,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:46,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 723 statements into 1 equivalence classes. [2025-03-03 10:49:46,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 723 of 723 statements. [2025-03-03 10:49:46,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:46,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 223 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:47,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:47,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180781736] [2025-03-03 10:49:47,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180781736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:47,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638868906] [2025-03-03 10:49:47,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:47,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:47,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:47,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:49:47,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:49:47,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 723 statements into 1 equivalence classes. [2025-03-03 10:49:47,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 723 of 723 statements. [2025-03-03 10:49:47,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:47,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:47,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 10:49:47,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 473 proven. 49 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:49:49,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:49:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 473 proven. 49 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:49:52,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638868906] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:49:52,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:49:52,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-03 10:49:52,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126723705] [2025-03-03 10:49:52,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:49:52,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 10:49:52,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:52,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 10:49:52,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-03 10:49:52,124 INFO L87 Difference]: Start difference. First operand 22232 states and 24065 transitions. Second operand has 14 states, 14 states have (on average 114.85714285714286) internal successors, (1608), 14 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:02,421 INFO L93 Difference]: Finished difference Result 91174 states and 97885 transitions. [2025-03-03 10:50:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-03 10:50:02,422 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 114.85714285714286) internal successors, (1608), 14 states have internal predecessors, (1608), 0 states have call successors, (0), 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 723 [2025-03-03 10:50:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:02,492 INFO L225 Difference]: With dead ends: 91174 [2025-03-03 10:50:02,492 INFO L226 Difference]: Without dead ends: 68075 [2025-03-03 10:50:02,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1545 GetRequests, 1471 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1172, Invalid=4528, Unknown=0, NotChecked=0, Total=5700 [2025-03-03 10:50:02,518 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 9229 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 14794 mSolverCounterSat, 3381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9229 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 18175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3381 IncrementalHoareTripleChecker+Valid, 14794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:02,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9229 Valid, 400 Invalid, 18175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3381 Valid, 14794 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2025-03-03 10:50:02,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68075 states. [2025-03-03 10:50:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68075 to 28508. [2025-03-03 10:50:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28508 states, 28507 states have (on average 1.0700178903427229) internal successors, (30503), 28507 states have internal predecessors, (30503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28508 states to 28508 states and 30503 transitions. [2025-03-03 10:50:02,961 INFO L78 Accepts]: Start accepts. Automaton has 28508 states and 30503 transitions. Word has length 723 [2025-03-03 10:50:02,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:02,962 INFO L471 AbstractCegarLoop]: Abstraction has 28508 states and 30503 transitions. [2025-03-03 10:50:02,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 114.85714285714286) internal successors, (1608), 14 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 28508 states and 30503 transitions. [2025-03-03 10:50:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 782 [2025-03-03 10:50:02,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:02,971 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:02,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:50:03,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:03,172 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:03,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1336084931, now seen corresponding path program 1 times [2025-03-03 10:50:03,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:03,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376035076] [2025-03-03 10:50:03,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:03,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 781 statements into 1 equivalence classes. [2025-03-03 10:50:03,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 781 of 781 statements. [2025-03-03 10:50:03,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:03,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 478 proven. 357 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-03-03 10:50:04,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:04,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376035076] [2025-03-03 10:50:04,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376035076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:50:04,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927008506] [2025-03-03 10:50:04,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:04,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:04,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:50:04,088 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:50:04,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:50:04,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 781 statements into 1 equivalence classes. [2025-03-03 10:50:04,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 781 of 781 statements. [2025-03-03 10:50:04,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:04,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:04,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:50:04,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:50:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2025-03-03 10:50:04,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:50:04,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927008506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:04,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:50:04,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:50:04,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690663568] [2025-03-03 10:50:04,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:04,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:04,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:04,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:04,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:50:04,309 INFO L87 Difference]: Start difference. First operand 28508 states and 30503 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:05,186 INFO L93 Difference]: Finished difference Result 56412 states and 60360 transitions. [2025-03-03 10:50:05,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:05,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 781 [2025-03-03 10:50:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:05,210 INFO L225 Difference]: With dead ends: 56412 [2025-03-03 10:50:05,210 INFO L226 Difference]: Without dead ends: 27906 [2025-03-03 10:50:05,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 782 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:50:05,226 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 279 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:05,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 558 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:50:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27906 states. [2025-03-03 10:50:05,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27906 to 27308. [2025-03-03 10:50:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27308 states, 27307 states have (on average 1.0451898780532465) internal successors, (28541), 27307 states have internal predecessors, (28541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27308 states to 27308 states and 28541 transitions. [2025-03-03 10:50:05,453 INFO L78 Accepts]: Start accepts. Automaton has 27308 states and 28541 transitions. Word has length 781 [2025-03-03 10:50:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:05,453 INFO L471 AbstractCegarLoop]: Abstraction has 27308 states and 28541 transitions. [2025-03-03 10:50:05,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 27308 states and 28541 transitions. [2025-03-03 10:50:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-03-03 10:50:05,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:05,464 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:05,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:50:05,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 10:50:05,664 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:05,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:05,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1062542136, now seen corresponding path program 1 times [2025-03-03 10:50:05,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:05,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332748618] [2025-03-03 10:50:05,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:05,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:05,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-03-03 10:50:05,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-03-03 10:50:05,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:05,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2025-03-03 10:50:05,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:05,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332748618] [2025-03-03 10:50:05,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332748618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:05,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:05,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:05,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229914656] [2025-03-03 10:50:05,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:05,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:05,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:05,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:05,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:05,992 INFO L87 Difference]: Start difference. First operand 27308 states and 28541 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:06,902 INFO L93 Difference]: Finished difference Result 59402 states and 62064 transitions. [2025-03-03 10:50:06,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:06,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 821 [2025-03-03 10:50:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:06,927 INFO L225 Difference]: With dead ends: 59402 [2025-03-03 10:50:06,927 INFO L226 Difference]: Without dead ends: 32096 [2025-03-03 10:50:06,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:06,942 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 293 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:06,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 462 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:50:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32096 states. [2025-03-03 10:50:07,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32096 to 29096. [2025-03-03 10:50:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29096 states, 29095 states have (on average 1.0427564873689636) internal successors, (30339), 29095 states have internal predecessors, (30339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29096 states to 29096 states and 30339 transitions. [2025-03-03 10:50:07,236 INFO L78 Accepts]: Start accepts. Automaton has 29096 states and 30339 transitions. Word has length 821 [2025-03-03 10:50:07,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:07,237 INFO L471 AbstractCegarLoop]: Abstraction has 29096 states and 30339 transitions. [2025-03-03 10:50:07,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:07,237 INFO L276 IsEmpty]: Start isEmpty. Operand 29096 states and 30339 transitions. [2025-03-03 10:50:07,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2025-03-03 10:50:07,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:07,251 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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] [2025-03-03 10:50:07,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:50:07,251 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:07,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:07,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1076164413, now seen corresponding path program 1 times [2025-03-03 10:50:07,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:07,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928257993] [2025-03-03 10:50:07,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:07,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:07,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 887 statements into 1 equivalence classes. [2025-03-03 10:50:07,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 887 of 887 statements. [2025-03-03 10:50:07,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:07,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 684 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-03 10:50:07,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928257993] [2025-03-03 10:50:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928257993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:07,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:07,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:07,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881382231] [2025-03-03 10:50:07,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:07,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:07,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:07,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:07,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:07,988 INFO L87 Difference]: Start difference. First operand 29096 states and 30339 transitions. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:08,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:08,870 INFO L93 Difference]: Finished difference Result 63289 states and 65976 transitions. [2025-03-03 10:50:08,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:08,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 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 887 [2025-03-03 10:50:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:08,903 INFO L225 Difference]: With dead ends: 63289 [2025-03-03 10:50:08,903 INFO L226 Difference]: Without dead ends: 34494 [2025-03-03 10:50:08,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:08,923 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 348 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:08,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 140 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:50:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34494 states. [2025-03-03 10:50:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34494 to 31486. [2025-03-03 10:50:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31486 states, 31485 states have (on average 1.0404319517230427) internal successors, (32758), 31485 states have internal predecessors, (32758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31486 states to 31486 states and 32758 transitions. [2025-03-03 10:50:09,195 INFO L78 Accepts]: Start accepts. Automaton has 31486 states and 32758 transitions. Word has length 887 [2025-03-03 10:50:09,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:09,195 INFO L471 AbstractCegarLoop]: Abstraction has 31486 states and 32758 transitions. [2025-03-03 10:50:09,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 31486 states and 32758 transitions. [2025-03-03 10:50:09,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2025-03-03 10:50:09,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:09,293 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:09,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:50:09,294 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:09,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:09,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2139156228, now seen corresponding path program 1 times [2025-03-03 10:50:09,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:09,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557234064] [2025-03-03 10:50:09,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:09,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:09,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 900 statements into 1 equivalence classes. [2025-03-03 10:50:09,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 900 of 900 statements. [2025-03-03 10:50:09,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:09,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-03 10:50:09,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:09,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557234064] [2025-03-03 10:50:09,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557234064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:09,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:09,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:09,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752305190] [2025-03-03 10:50:09,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:09,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:09,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:09,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:09,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:09,712 INFO L87 Difference]: Start difference. First operand 31486 states and 32758 transitions. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:10,507 INFO L93 Difference]: Finished difference Result 67172 states and 69877 transitions. [2025-03-03 10:50:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:10,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 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 900 [2025-03-03 10:50:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:10,539 INFO L225 Difference]: With dead ends: 67172 [2025-03-03 10:50:10,539 INFO L226 Difference]: Without dead ends: 35987 [2025-03-03 10:50:10,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:10,559 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 32 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:10,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 575 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:50:10,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35987 states. [2025-03-03 10:50:10,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35987 to 31199. [2025-03-03 10:50:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31199 states, 31198 states have (on average 1.0378870440412846) internal successors, (32380), 31198 states have internal predecessors, (32380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31199 states to 31199 states and 32380 transitions. [2025-03-03 10:50:10,812 INFO L78 Accepts]: Start accepts. Automaton has 31199 states and 32380 transitions. Word has length 900 [2025-03-03 10:50:10,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:10,813 INFO L471 AbstractCegarLoop]: Abstraction has 31199 states and 32380 transitions. [2025-03-03 10:50:10,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:10,813 INFO L276 IsEmpty]: Start isEmpty. Operand 31199 states and 32380 transitions. [2025-03-03 10:50:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 938 [2025-03-03 10:50:10,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:10,826 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:10,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:50:10,826 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:10,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash -45700739, now seen corresponding path program 1 times [2025-03-03 10:50:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926338697] [2025-03-03 10:50:10,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:10,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 937 statements into 1 equivalence classes. [2025-03-03 10:50:10,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 937 of 937 statements. [2025-03-03 10:50:10,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:10,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2025-03-03 10:50:11,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:11,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926338697] [2025-03-03 10:50:11,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926338697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:11,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:11,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:50:11,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112823531] [2025-03-03 10:50:11,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:11,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:50:11,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:11,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:50:11,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:11,306 INFO L87 Difference]: Start difference. First operand 31199 states and 32380 transitions. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:12,488 INFO L93 Difference]: Finished difference Result 69581 states and 72155 transitions. [2025-03-03 10:50:12,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:50:12,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 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 937 [2025-03-03 10:50:12,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:12,524 INFO L225 Difference]: With dead ends: 69581 [2025-03-03 10:50:12,524 INFO L226 Difference]: Without dead ends: 38683 [2025-03-03 10:50:12,544 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-03 10:50:12,545 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 903 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:12,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 205 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:50:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38683 states. [2025-03-03 10:50:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38683 to 31796. [2025-03-03 10:50:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31796 states, 31795 states have (on average 1.0351942129265608) internal successors, (32914), 31795 states have internal predecessors, (32914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31796 states to 31796 states and 32914 transitions. [2025-03-03 10:50:12,829 INFO L78 Accepts]: Start accepts. Automaton has 31796 states and 32914 transitions. Word has length 937 [2025-03-03 10:50:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:12,870 INFO L471 AbstractCegarLoop]: Abstraction has 31796 states and 32914 transitions. [2025-03-03 10:50:12,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 31796 states and 32914 transitions. [2025-03-03 10:50:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 973 [2025-03-03 10:50:12,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:12,886 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:12,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:50:12,886 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:12,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1958423998, now seen corresponding path program 1 times [2025-03-03 10:50:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:12,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365272680] [2025-03-03 10:50:12,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:12,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:12,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 972 statements into 1 equivalence classes. [2025-03-03 10:50:12,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 972 of 972 statements. [2025-03-03 10:50:12,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:12,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 800 proven. 179 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 10:50:14,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:14,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365272680] [2025-03-03 10:50:14,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365272680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:50:14,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987561964] [2025-03-03 10:50:14,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:14,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:14,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:50:14,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:50:14,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:50:14,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 972 statements into 1 equivalence classes. [2025-03-03 10:50:14,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 972 of 972 statements. [2025-03-03 10:50:14,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:14,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:14,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 10:50:14,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:50:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 769 proven. 49 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2025-03-03 10:50:15,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:50:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2025-03-03 10:50:15,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987561964] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:50:15,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:50:15,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-03-03 10:50:15,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370222673] [2025-03-03 10:50:15,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:15,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:50:15,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:15,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:50:15,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:50:15,553 INFO L87 Difference]: Start difference. First operand 31796 states and 32914 transitions. Second operand has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:16,900 INFO L93 Difference]: Finished difference Result 68398 states and 70760 transitions. [2025-03-03 10:50:16,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:50:16,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 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 972 [2025-03-03 10:50:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:16,931 INFO L225 Difference]: With dead ends: 68398 [2025-03-03 10:50:16,931 INFO L226 Difference]: Without dead ends: 36604 [2025-03-03 10:50:16,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1948 GetRequests, 1940 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:50:16,947 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 339 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:16,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 87 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:50:16,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36604 states. [2025-03-03 10:50:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36604 to 31497. [2025-03-03 10:50:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31497 states, 31496 states have (on average 1.0350838201676404) internal successors, (32601), 31496 states have internal predecessors, (32601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31497 states to 31497 states and 32601 transitions. [2025-03-03 10:50:17,207 INFO L78 Accepts]: Start accepts. Automaton has 31497 states and 32601 transitions. Word has length 972 [2025-03-03 10:50:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:17,208 INFO L471 AbstractCegarLoop]: Abstraction has 31497 states and 32601 transitions. [2025-03-03 10:50:17,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 31497 states and 32601 transitions. [2025-03-03 10:50:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1084 [2025-03-03 10:50:17,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:17,284 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:17,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:50:17,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:17,485 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:17,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:17,485 INFO L85 PathProgramCache]: Analyzing trace with hash -287319572, now seen corresponding path program 1 times [2025-03-03 10:50:17,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:17,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779700799] [2025-03-03 10:50:17,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:17,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:17,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1083 statements into 1 equivalence classes. [2025-03-03 10:50:17,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1083 of 1083 statements. [2025-03-03 10:50:17,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:17,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 1355 proven. 0 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2025-03-03 10:50:18,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:18,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779700799] [2025-03-03 10:50:18,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779700799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:18,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:18,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:18,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879167334] [2025-03-03 10:50:18,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:18,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:18,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:18,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:18,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:18,003 INFO L87 Difference]: Start difference. First operand 31497 states and 32601 transitions. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:18,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:18,622 INFO L93 Difference]: Finished difference Result 49785 states and 51356 transitions. [2025-03-03 10:50:18,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:18,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 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 1083 [2025-03-03 10:50:18,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:18,638 INFO L225 Difference]: With dead ends: 49785 [2025-03-03 10:50:18,638 INFO L226 Difference]: Without dead ends: 17094 [2025-03-03 10:50:18,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:18,653 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 236 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:18,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 369 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:50:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17094 states. [2025-03-03 10:50:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17094 to 14996. [2025-03-03 10:50:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14996 states, 14995 states have (on average 1.0223407802600868) internal successors, (15330), 14995 states have internal predecessors, (15330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14996 states to 14996 states and 15330 transitions. [2025-03-03 10:50:18,770 INFO L78 Accepts]: Start accepts. Automaton has 14996 states and 15330 transitions. Word has length 1083 [2025-03-03 10:50:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:18,770 INFO L471 AbstractCegarLoop]: Abstraction has 14996 states and 15330 transitions. [2025-03-03 10:50:18,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 14996 states and 15330 transitions. [2025-03-03 10:50:18,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1443 [2025-03-03 10:50:18,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:18,787 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:50:18,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:50:18,788 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:18,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:18,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1702611716, now seen corresponding path program 1 times [2025-03-03 10:50:18,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:18,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883436228] [2025-03-03 10:50:18,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:18,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:18,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1442 statements into 1 equivalence classes. [2025-03-03 10:50:18,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1442 of 1442 statements. [2025-03-03 10:50:18,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:18,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3360 backedges. 1971 proven. 0 refuted. 0 times theorem prover too weak. 1389 trivial. 0 not checked. [2025-03-03 10:50:19,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:19,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883436228] [2025-03-03 10:50:19,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883436228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:19,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:19,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:19,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048136589] [2025-03-03 10:50:19,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:19,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:19,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:19,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:19,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:19,269 INFO L87 Difference]: Start difference. First operand 14996 states and 15330 transitions. Second operand has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:19,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:19,839 INFO L93 Difference]: Finished difference Result 28491 states and 29140 transitions. [2025-03-03 10:50:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:19,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 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 1442 [2025-03-03 10:50:19,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:19,841 INFO L225 Difference]: With dead ends: 28491 [2025-03-03 10:50:19,841 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:50:19,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:19,850 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:19,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 406 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:50:19,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:50:19,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:50:19,851 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-03 10:50:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:50:19,851 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1442 [2025-03-03 10:50:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:19,851 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:50:19,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:50:19,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:50:19,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:50:19,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 10:50:19,857 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-03 10:50:19,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:50:27,202 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:50:27,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:50:27 BoogieIcfgContainer [2025-03-03 10:50:27,226 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:50:27,226 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:50:27,226 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:50:27,227 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:50:27,227 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:23" (3/4) ... [2025-03-03 10:50:27,229 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:50:27,255 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-03 10:50:27,257 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:50:27,258 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:50:27,259 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:50:27,387 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:50:27,388 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:50:27,388 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:50:27,389 INFO L158 Benchmark]: Toolchain (without parser) took 67232.15ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 118.7MB in the beginning and 976.5MB in the end (delta: -857.7MB). Peak memory consumption was 199.2MB. Max. memory is 16.1GB. [2025-03-03 10:50:27,389 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:50:27,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.52ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 47.1MB in the end (delta: 71.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-03 10:50:27,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 169.03ms. Allocated memory is still 167.8MB. Free memory was 47.1MB in the beginning and 87.2MB in the end (delta: -40.1MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2025-03-03 10:50:27,390 INFO L158 Benchmark]: Boogie Preprocessor took 224.04ms. Allocated memory is still 167.8MB. Free memory was 87.2MB in the beginning and 97.5MB in the end (delta: -10.3MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2025-03-03 10:50:27,390 INFO L158 Benchmark]: IcfgBuilder took 2171.97ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 97.5MB in the beginning and 331.1MB in the end (delta: -233.6MB). Peak memory consumption was 221.4MB. Max. memory is 16.1GB. [2025-03-03 10:50:27,391 INFO L158 Benchmark]: TraceAbstraction took 63930.57ms. Allocated memory was 411.0MB in the beginning and 1.2GB in the end (delta: 813.7MB). Free memory was 331.1MB in the beginning and 1.0GB in the end (delta: -670.5MB). Peak memory consumption was 856.8MB. Max. memory is 16.1GB. [2025-03-03 10:50:27,391 INFO L158 Benchmark]: Witness Printer took 161.38ms. Allocated memory is still 1.2GB. Free memory was 1.0GB in the beginning and 976.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 10:50:27,392 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.21ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.52ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 47.1MB in the end (delta: 71.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 169.03ms. Allocated memory is still 167.8MB. Free memory was 47.1MB in the beginning and 87.2MB in the end (delta: -40.1MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 224.04ms. Allocated memory is still 167.8MB. Free memory was 87.2MB in the beginning and 97.5MB in the end (delta: -10.3MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. * IcfgBuilder took 2171.97ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 97.5MB in the beginning and 331.1MB in the end (delta: -233.6MB). Peak memory consumption was 221.4MB. Max. memory is 16.1GB. * TraceAbstraction took 63930.57ms. Allocated memory was 411.0MB in the beginning and 1.2GB in the end (delta: 813.7MB). Free memory was 331.1MB in the beginning and 1.0GB in the end (delta: -670.5MB). Peak memory consumption was 856.8MB. Max. memory is 16.1GB. * Witness Printer took 161.38ms. Allocated memory is still 1.2GB. Free memory was 1.0GB in the beginning and 976.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: 170]: 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, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.5s, OverallIterations: 23, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 33.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15227 SdHoareTripleChecker+Valid, 29.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15227 mSDsluCounter, 9498 SdHoareTripleChecker+Invalid, 25.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1121 mSDsCounter, 7530 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35530 IncrementalHoareTripleChecker+Invalid, 43060 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7530 mSolverCounterUnsat, 8377 mSDtfsCounter, 35530 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5341 GetRequests, 5229 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2173 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31796occurred in iteration=20, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 81019 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 17123 NumberOfCodeBlocks, 17123 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 18788 ConstructedInterpolants, 0 QuantifiedInterpolants, 61225 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4131 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 22149/23430 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: 1776]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((((((0 <= ((long long) a4 + 85)) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (a2 == 4)) || (((((long long) 148 + a0) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85)))) || (((((long long) a0 + 99) <= 0) && (((long long) 89 + a4) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((0 <= ((long long) 97 + a0)) && (0 <= ((long long) a4 + 85))) && (a2 == 1)) && (a29 <= 43))) || (((((long long) a0 + 99) <= 0) && (((long long) 89 + a4) <= 0)) && (a2 == 1))) || (((((0 <= ((long long) a4 + 85)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853))) || ((((((long long) 148 + a0) <= 0) && (0 <= ((long long) a4 + 85))) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (a2 == 4))) || (((0 <= ((long long) a29 + 15)) && (((long long) a0 + 99) <= 0)) && (((long long) 89 + a4) <= 0))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (a29 <= 43))) || ((((((long long) 148 + a0) <= 0) && (44 <= a29)) && (5 <= a2)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853))) || (((((0 <= ((long long) a4 + 85)) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 99) <= 0)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (a2 == 4))) || (((((0 <= ((long long) a4 + 85)) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (5 <= a2)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853))) || (((((long long) a0 + 99) <= 0) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) 146 + a0)))) || (((((long long) a0 + 147) <= 0) && (((0 <= ((long long) a4 + 85)) && (3 == a2)) || ((0 <= ((long long) a29 + 15)) && (3 == a2)))) && (a29 <= 43))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853))) || ((((2 == a2) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0))) || ((((0 <= ((long long) a4 + 85)) && (0 <= ((long long) a29 + 15))) && (a2 == 1)) && (a29 <= 43))) || (((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || ((((((long long) 148 + a0) <= 0) && (0 <= ((long long) a4 + 85))) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (3 == a2))) || ((((0 <= ((long long) a4 + 85)) && (((long long) a0 + 99) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || ((((0 <= ((long long) a4 + 85)) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || ((((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (a2 == 1)) && (a29 <= 43))) || ((((long long) 148 + a0) <= 0) && (a2 == 1))) || (((((0 <= ((long long) a4 + 85)) && (((long long) 98 + a0) <= 0)) && (5 <= a2)) && (a29 <= 43)) && (0 <= ((long long) a29 + 192415)))) || (((((2 == a2) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) 98 + a0) <= 0)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853))) || ((((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (a2 == 4))) || ((((0 <= ((long long) 143 + a0)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 99) <= 0)) && (3 == a2))) || ((((((long long) 89 + a4) <= 0) && (5 <= a2)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (0 <= ((long long) a29 + 192415)))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a29 + 144) <= 0))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 144) <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:50:27,414 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