./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label46.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_label46.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 e6cfda55b4df00060532ae07426d70949a0fc78613832cd8fb2b21614956b3d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:52:07,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:52:07,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:52:07,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:52:07,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:52:07,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:52:07,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:52:07,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:52:07,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:52:07,389 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:52:07,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:52:07,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:52:07,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:52:07,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:52:07,390 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:52:07,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:52:07,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:52:07,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:52:07,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:52:07,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:52:07,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:52:07,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:52:07,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:52:07,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:52:07,391 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:52:07,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:52:07,391 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:52:07,392 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:52:07,392 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:52:07,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:52:07,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:52:07,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:52:07,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:52:07,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:52:07,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:52:07,392 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:52:07,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:52:07,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:52:07,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:52:07,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:52:07,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:52:07,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:52:07,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:52:07,393 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 -> e6cfda55b4df00060532ae07426d70949a0fc78613832cd8fb2b21614956b3d6 [2025-03-03 10:52:07,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:52:07,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:52:07,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:52:07,651 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:52:07,652 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:52:07,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label46.c [2025-03-03 10:52:08,746 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dcdbd4f6/5418a70346c54cbcade9069c94641c81/FLAG3c79c302b [2025-03-03 10:52:09,152 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:52:09,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label46.c [2025-03-03 10:52:09,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dcdbd4f6/5418a70346c54cbcade9069c94641c81/FLAG3c79c302b [2025-03-03 10:52:09,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dcdbd4f6/5418a70346c54cbcade9069c94641c81 [2025-03-03 10:52:09,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:52:09,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:52:09,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:52:09,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:52:09,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:52:09,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:52:09" (1/1) ... [2025-03-03 10:52:09,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4df92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:09, skipping insertion in model container [2025-03-03 10:52:09,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:52:09" (1/1) ... [2025-03-03 10:52:09,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:52:09,375 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_label46.c[5357,5370] [2025-03-03 10:52:09,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:52:09,673 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:52:09,687 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_label46.c[5357,5370] [2025-03-03 10:52:09,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:52:09,839 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:52:09,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:09 WrapperNode [2025-03-03 10:52:09,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:52:09,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:52:09,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:52:09,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:52:09,845 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:52:09" (1/1) ... [2025-03-03 10:52:09,872 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:52:09" (1/1) ... [2025-03-03 10:52:09,983 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-03 10:52:09,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:52:09,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:52:09,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:52:09,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:52:09,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:09" (1/1) ... [2025-03-03 10:52:09,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:09" (1/1) ... [2025-03-03 10:52:10,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:09" (1/1) ... [2025-03-03 10:52:10,100 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:52:10,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:09" (1/1) ... [2025-03-03 10:52:10,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:09" (1/1) ... [2025-03-03 10:52:10,135 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:09" (1/1) ... [2025-03-03 10:52:10,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:09" (1/1) ... [2025-03-03 10:52:10,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:09" (1/1) ... [2025-03-03 10:52:10,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:09" (1/1) ... [2025-03-03 10:52:10,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:52:10,190 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:52:10,191 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:52:10,191 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:52:10,192 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:09" (1/1) ... [2025-03-03 10:52:10,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:52:10,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:52:10,242 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:52:10,247 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:52:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:52:10,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:52:10,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:52:10,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:52:10,310 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:52:10,312 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:52:12,264 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-03 10:52:12,331 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-03 10:52:12,331 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:52:12,344 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:52:12,344 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:52:12,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:52:12 BoogieIcfgContainer [2025-03-03 10:52:12,344 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:52:12,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:52:12,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:52:12,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:52:12,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:52:09" (1/3) ... [2025-03-03 10:52:12,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4925a545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:52:12, skipping insertion in model container [2025-03-03 10:52:12,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:09" (2/3) ... [2025-03-03 10:52:12,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4925a545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:52:12, skipping insertion in model container [2025-03-03 10:52:12,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:52:12" (3/3) ... [2025-03-03 10:52:12,354 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label46.c [2025-03-03 10:52:12,365 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:52:12,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label46.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:52:12,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:52:12,431 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;@50cf49c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:52:12,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:52:12,436 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:52:12,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 10:52:12,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:12,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:52:12,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:12,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:12,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1857074208, now seen corresponding path program 1 times [2025-03-03 10:52:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:12,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730248507] [2025-03-03 10:52:12,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:12,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 10:52:12,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 10:52:12,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:12,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:12,764 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:52:12,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:12,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730248507] [2025-03-03 10:52:12,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730248507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:12,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:12,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:52:12,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127992944] [2025-03-03 10:52:12,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:12,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:12,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:12,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:12,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:12,785 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 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:52:14,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:14,164 INFO L93 Difference]: Finished difference Result 1155 states and 2103 transitions. [2025-03-03 10:52:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:14,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-03 10:52:14,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:14,178 INFO L225 Difference]: With dead ends: 1155 [2025-03-03 10:52:14,178 INFO L226 Difference]: Without dead ends: 667 [2025-03-03 10:52:14,181 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:52:14,183 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 301 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:14,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 370 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:52:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-03 10:52:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2025-03-03 10:52:14,225 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:52:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2025-03-03 10:52:14,232 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 43 [2025-03-03 10:52:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:14,232 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2025-03-03 10:52:14,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:52:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2025-03-03 10:52:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 10:52:14,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:14,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:14,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:52:14,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:14,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1931572327, now seen corresponding path program 1 times [2025-03-03 10:52:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:14,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086294305] [2025-03-03 10:52:14,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:14,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:14,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 10:52:14,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 10:52:14,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:14,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:52:14,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:14,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086294305] [2025-03-03 10:52:14,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086294305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:14,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:14,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:52:14,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696660230] [2025-03-03 10:52:14,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:14,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:14,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:14,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:14,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:14,471 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have 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:52:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:15,931 INFO L93 Difference]: Finished difference Result 1953 states and 2893 transitions. [2025-03-03 10:52:15,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:15,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-03 10:52:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:15,935 INFO L225 Difference]: With dead ends: 1953 [2025-03-03 10:52:15,935 INFO L226 Difference]: Without dead ends: 1290 [2025-03-03 10:52:15,936 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:52:15,937 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 256 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:15,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 324 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:52:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-03-03 10:52:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282. [2025-03-03 10:52:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 1.3981264637002342) internal successors, (1791), 1281 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have 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:52:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1791 transitions. [2025-03-03 10:52:15,969 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1791 transitions. Word has length 118 [2025-03-03 10:52:15,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:15,970 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1791 transitions. [2025-03-03 10:52:15,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have 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:52:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1791 transitions. [2025-03-03 10:52:15,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 10:52:15,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:15,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:15,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:52:15,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:15,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2087676259, now seen corresponding path program 1 times [2025-03-03 10:52:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369623222] [2025-03-03 10:52:15,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:15,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:15,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 10:52:16,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 10:52:16,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:16,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:52:16,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:16,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369623222] [2025-03-03 10:52:16,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369623222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:16,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:16,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:52:16,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764700329] [2025-03-03 10:52:16,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:16,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:16,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:16,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:16,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:16,129 INFO L87 Difference]: Start difference. First operand 1282 states and 1791 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have 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:52:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:17,351 INFO L93 Difference]: Finished difference Result 3766 states and 5261 transitions. [2025-03-03 10:52:17,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:17,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-03-03 10:52:17,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:17,358 INFO L225 Difference]: With dead ends: 3766 [2025-03-03 10:52:17,358 INFO L226 Difference]: Without dead ends: 2486 [2025-03-03 10:52:17,360 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:52:17,360 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:52:17,361 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:52:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-03-03 10:52:17,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2182. [2025-03-03 10:52:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2181 states have (on average 1.2815222375057314) internal successors, (2795), 2181 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have 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:52:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2795 transitions. [2025-03-03 10:52:17,391 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2795 transitions. Word has length 122 [2025-03-03 10:52:17,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:17,391 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 2795 transitions. [2025-03-03 10:52:17,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have 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:52:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2795 transitions. [2025-03-03 10:52:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-03 10:52:17,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:17,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:17,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:52:17,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:17,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:17,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1549015574, now seen corresponding path program 1 times [2025-03-03 10:52:17,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:17,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719951492] [2025-03-03 10:52:17,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:17,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:17,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-03 10:52:17,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-03 10:52:17,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:17,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:52:17,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:17,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719951492] [2025-03-03 10:52:17,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719951492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:17,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:17,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:52:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140436942] [2025-03-03 10:52:17,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:17,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:17,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:17,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:17,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:17,636 INFO L87 Difference]: Start difference. First operand 2182 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have 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:52:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:18,756 INFO L93 Difference]: Finished difference Result 5567 states and 7266 transitions. [2025-03-03 10:52:18,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:18,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2025-03-03 10:52:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:18,767 INFO L225 Difference]: With dead ends: 5567 [2025-03-03 10:52:18,767 INFO L226 Difference]: Without dead ends: 3387 [2025-03-03 10:52:18,771 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:52:18,771 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 285 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:18,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 614 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:52:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2025-03-03 10:52:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3385. [2025-03-03 10:52:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.216016548463357) internal successors, (4115), 3384 states have internal predecessors, (4115), 0 states have call successors, (0), 0 states have 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:52:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4115 transitions. [2025-03-03 10:52:18,823 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4115 transitions. Word has length 239 [2025-03-03 10:52:18,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:18,824 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 4115 transitions. [2025-03-03 10:52:18,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have 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:52:18,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4115 transitions. [2025-03-03 10:52:18,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-03 10:52:18,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:18,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:18,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:52:18,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:18,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:18,827 INFO L85 PathProgramCache]: Analyzing trace with hash 532497304, now seen corresponding path program 1 times [2025-03-03 10:52:18,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:18,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124415987] [2025-03-03 10:52:18,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:18,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:18,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-03 10:52:18,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-03 10:52:18,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:18,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 10:52:19,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:19,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124415987] [2025-03-03 10:52:19,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124415987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:19,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:19,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:52:19,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720182298] [2025-03-03 10:52:19,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:19,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:19,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:19,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:19,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:19,127 INFO L87 Difference]: Start difference. First operand 3385 states and 4115 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:52:20,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:20,877 INFO L93 Difference]: Finished difference Result 8870 states and 10887 transitions. [2025-03-03 10:52:20,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:20,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 325 [2025-03-03 10:52:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:20,893 INFO L225 Difference]: With dead ends: 8870 [2025-03-03 10:52:20,893 INFO L226 Difference]: Without dead ends: 5487 [2025-03-03 10:52:20,896 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:52:20,896 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 31 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:20,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 316 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:52:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5487 states. [2025-03-03 10:52:20,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5487 to 5484. [2025-03-03 10:52:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5484 states, 5483 states have (on average 1.1752690133138792) internal successors, (6444), 5483 states have internal predecessors, (6444), 0 states have call successors, (0), 0 states have 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:52:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 6444 transitions. [2025-03-03 10:52:20,960 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 6444 transitions. Word has length 325 [2025-03-03 10:52:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:20,960 INFO L471 AbstractCegarLoop]: Abstraction has 5484 states and 6444 transitions. [2025-03-03 10:52:20,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:52:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 6444 transitions. [2025-03-03 10:52:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-03-03 10:52:20,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:20,964 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:52:20,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:52:20,965 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:20,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:20,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1022133525, now seen corresponding path program 1 times [2025-03-03 10:52:20,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:20,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908507744] [2025-03-03 10:52:20,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:20,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:21,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-03 10:52:21,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-03 10:52:21,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:21,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:52:21,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:21,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908507744] [2025-03-03 10:52:21,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908507744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:21,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:21,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:52:21,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14615840] [2025-03-03 10:52:21,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:21,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:21,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:21,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:21,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:21,270 INFO L87 Difference]: Start difference. First operand 5484 states and 6444 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:52:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:22,539 INFO L93 Difference]: Finished difference Result 13065 states and 15599 transitions. [2025-03-03 10:52:22,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:22,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 389 [2025-03-03 10:52:22,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:22,565 INFO L225 Difference]: With dead ends: 13065 [2025-03-03 10:52:22,565 INFO L226 Difference]: Without dead ends: 7583 [2025-03-03 10:52:22,572 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:52:22,574 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 284 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:22,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 641 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:52:22,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2025-03-03 10:52:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 6985. [2025-03-03 10:52:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6985 states, 6984 states have (on average 1.1539232531500572) internal successors, (8059), 6984 states have internal predecessors, (8059), 0 states have call successors, (0), 0 states have 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:52:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6985 states to 6985 states and 8059 transitions. [2025-03-03 10:52:22,674 INFO L78 Accepts]: Start accepts. Automaton has 6985 states and 8059 transitions. Word has length 389 [2025-03-03 10:52:22,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:22,674 INFO L471 AbstractCegarLoop]: Abstraction has 6985 states and 8059 transitions. [2025-03-03 10:52:22,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:52:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 6985 states and 8059 transitions. [2025-03-03 10:52:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-03 10:52:22,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:22,679 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:52:22,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:52:22,680 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:22,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:22,680 INFO L85 PathProgramCache]: Analyzing trace with hash 41210706, now seen corresponding path program 1 times [2025-03-03 10:52:22,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:22,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100108510] [2025-03-03 10:52:22,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:22,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:22,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-03 10:52:22,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-03 10:52:22,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:22,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:52:22,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:22,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100108510] [2025-03-03 10:52:22,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100108510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:22,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:22,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:52:22,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055068544] [2025-03-03 10:52:22,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:22,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:22,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:22,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:22,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:22,997 INFO L87 Difference]: Start difference. First operand 6985 states and 8059 transitions. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have 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:52:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:24,106 INFO L93 Difference]: Finished difference Result 15770 states and 18503 transitions. [2025-03-03 10:52:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:24,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 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 406 [2025-03-03 10:52:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:24,125 INFO L225 Difference]: With dead ends: 15770 [2025-03-03 10:52:24,125 INFO L226 Difference]: Without dead ends: 8787 [2025-03-03 10:52:24,132 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:52:24,133 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 248 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:24,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 629 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:52:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8787 states. [2025-03-03 10:52:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8787 to 8481. [2025-03-03 10:52:24,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8481 states, 8480 states have (on average 1.1386792452830188) internal successors, (9656), 8480 states have internal predecessors, (9656), 0 states have call successors, (0), 0 states have 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:52:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 9656 transitions. [2025-03-03 10:52:24,252 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 9656 transitions. Word has length 406 [2025-03-03 10:52:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:24,252 INFO L471 AbstractCegarLoop]: Abstraction has 8481 states and 9656 transitions. [2025-03-03 10:52:24,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have 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:52:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 9656 transitions. [2025-03-03 10:52:24,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-03-03 10:52:24,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:24,259 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:52:24,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:52:24,259 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:24,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1868930238, now seen corresponding path program 1 times [2025-03-03 10:52:24,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:24,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393839553] [2025-03-03 10:52:24,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:24,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:24,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-03 10:52:24,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-03 10:52:24,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:24,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 10:52:24,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:24,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393839553] [2025-03-03 10:52:24,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393839553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:24,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:24,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:52:24,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473742474] [2025-03-03 10:52:24,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:24,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:24,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:24,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:24,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:24,527 INFO L87 Difference]: Start difference. First operand 8481 states and 9656 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:52:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:25,644 INFO L93 Difference]: Finished difference Result 20249 states and 23173 transitions. [2025-03-03 10:52:25,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:25,645 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 416 [2025-03-03 10:52:25,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:25,661 INFO L225 Difference]: With dead ends: 20249 [2025-03-03 10:52:25,661 INFO L226 Difference]: Without dead ends: 11770 [2025-03-03 10:52:25,664 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:52:25,665 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 273 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:25,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 310 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:52:25,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11770 states. [2025-03-03 10:52:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11770 to 7578. [2025-03-03 10:52:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 7577 states have (on average 1.1493994984822489) internal successors, (8709), 7577 states have internal predecessors, (8709), 0 states have call successors, (0), 0 states have 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:52:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 8709 transitions. [2025-03-03 10:52:25,741 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 8709 transitions. Word has length 416 [2025-03-03 10:52:25,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:25,742 INFO L471 AbstractCegarLoop]: Abstraction has 7578 states and 8709 transitions. [2025-03-03 10:52:25,742 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:52:25,742 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 8709 transitions. [2025-03-03 10:52:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-03 10:52:25,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:25,746 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:25,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:52:25,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:25,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash -608853428, now seen corresponding path program 1 times [2025-03-03 10:52:25,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:25,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354427443] [2025-03-03 10:52:25,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:25,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:25,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-03 10:52:25,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-03 10:52:25,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:25,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-03-03 10:52:26,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:26,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354427443] [2025-03-03 10:52:26,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354427443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:26,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:26,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:52:26,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76189538] [2025-03-03 10:52:26,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:26,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:26,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:26,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:26,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:26,294 INFO L87 Difference]: Start difference. First operand 7578 states and 8709 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:52:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:27,269 INFO L93 Difference]: Finished difference Result 15453 states and 17727 transitions. [2025-03-03 10:52:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:27,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 433 [2025-03-03 10:52:27,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:27,279 INFO L225 Difference]: With dead ends: 15453 [2025-03-03 10:52:27,280 INFO L226 Difference]: Without dead ends: 7877 [2025-03-03 10:52:27,285 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:52:27,289 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:27,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 354 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:52:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7877 states. [2025-03-03 10:52:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7877 to 7877. [2025-03-03 10:52:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7877 states, 7876 states have (on average 1.1444895886236668) internal successors, (9014), 7876 states have internal predecessors, (9014), 0 states have call successors, (0), 0 states have 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:52:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7877 states to 7877 states and 9014 transitions. [2025-03-03 10:52:27,354 INFO L78 Accepts]: Start accepts. Automaton has 7877 states and 9014 transitions. Word has length 433 [2025-03-03 10:52:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:27,354 INFO L471 AbstractCegarLoop]: Abstraction has 7877 states and 9014 transitions. [2025-03-03 10:52:27,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:52:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 7877 states and 9014 transitions. [2025-03-03 10:52:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-03-03 10:52:27,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:27,361 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:27,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:52:27,361 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:27,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:27,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1693464008, now seen corresponding path program 1 times [2025-03-03 10:52:27,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:27,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222322051] [2025-03-03 10:52:27,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:27,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:27,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-03-03 10:52:27,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-03-03 10:52:27,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:27,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-03-03 10:52:27,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:27,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222322051] [2025-03-03 10:52:27,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222322051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:27,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:27,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:52:27,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528472375] [2025-03-03 10:52:27,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:27,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:27,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:27,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:27,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:27,567 INFO L87 Difference]: Start difference. First operand 7877 states and 9014 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have 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:52:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:28,859 INFO L93 Difference]: Finished difference Result 17844 states and 20678 transitions. [2025-03-03 10:52:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:28,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 507 [2025-03-03 10:52:28,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:28,874 INFO L225 Difference]: With dead ends: 17844 [2025-03-03 10:52:28,874 INFO L226 Difference]: Without dead ends: 10268 [2025-03-03 10:52:28,881 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:52:28,882 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 372 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:28,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 446 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:52:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10268 states. [2025-03-03 10:52:28,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10268 to 10268. [2025-03-03 10:52:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10268 states, 10267 states have (on average 1.146878348105581) internal successors, (11775), 10267 states have internal predecessors, (11775), 0 states have call successors, (0), 0 states have 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:52:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 11775 transitions. [2025-03-03 10:52:28,972 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 11775 transitions. Word has length 507 [2025-03-03 10:52:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:28,973 INFO L471 AbstractCegarLoop]: Abstraction has 10268 states and 11775 transitions. [2025-03-03 10:52:28,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have 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:52:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 11775 transitions. [2025-03-03 10:52:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-03-03 10:52:28,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:28,977 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:52:28,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:52:28,978 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:28,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:28,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1212029572, now seen corresponding path program 1 times [2025-03-03 10:52:28,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:28,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644931665] [2025-03-03 10:52:28,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:28,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:29,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-03-03 10:52:29,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-03 10:52:29,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:29,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-03 10:52:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644931665] [2025-03-03 10:52:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644931665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:29,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:29,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:52:29,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793544240] [2025-03-03 10:52:29,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:29,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:29,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:29,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:29,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:29,306 INFO L87 Difference]: Start difference. First operand 10268 states and 11775 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:52:30,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:30,464 INFO L93 Difference]: Finished difference Result 25033 states and 28938 transitions. [2025-03-03 10:52:30,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:30,465 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 531 [2025-03-03 10:52:30,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:30,481 INFO L225 Difference]: With dead ends: 25033 [2025-03-03 10:52:30,481 INFO L226 Difference]: Without dead ends: 15066 [2025-03-03 10:52:30,489 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:52:30,490 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 248 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:30,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:52:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15066 states. [2025-03-03 10:52:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15066 to 15055. [2025-03-03 10:52:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15055 states, 15054 states have (on average 1.1306629467251228) internal successors, (17021), 15054 states have internal predecessors, (17021), 0 states have call successors, (0), 0 states have 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:52:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15055 states to 15055 states and 17021 transitions. [2025-03-03 10:52:30,624 INFO L78 Accepts]: Start accepts. Automaton has 15055 states and 17021 transitions. Word has length 531 [2025-03-03 10:52:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:30,625 INFO L471 AbstractCegarLoop]: Abstraction has 15055 states and 17021 transitions. [2025-03-03 10:52:30,625 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:52:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 15055 states and 17021 transitions. [2025-03-03 10:52:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-03-03 10:52:30,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:30,631 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:52:30,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:52:30,632 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:30,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:30,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1350802898, now seen corresponding path program 1 times [2025-03-03 10:52:30,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:30,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910784213] [2025-03-03 10:52:30,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:30,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:30,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-03-03 10:52:30,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-03-03 10:52:30,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:30,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-03 10:52:30,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:30,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910784213] [2025-03-03 10:52:30,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910784213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:30,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:30,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:52:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240336431] [2025-03-03 10:52:30,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:30,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:30,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:30,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:30,948 INFO L87 Difference]: Start difference. First operand 15055 states and 17021 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have 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:52:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:31,845 INFO L93 Difference]: Finished difference Result 31005 states and 35004 transitions. [2025-03-03 10:52:31,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:31,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 585 [2025-03-03 10:52:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:31,861 INFO L225 Difference]: With dead ends: 31005 [2025-03-03 10:52:31,861 INFO L226 Difference]: Without dead ends: 15055 [2025-03-03 10:52:31,872 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:52:31,872 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 259 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:31,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 666 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:52:31,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15055 states. [2025-03-03 10:52:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15055 to 15055. [2025-03-03 10:52:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15055 states, 15054 states have (on average 1.1287365484256675) internal successors, (16992), 15054 states have internal predecessors, (16992), 0 states have call successors, (0), 0 states have 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:52:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15055 states to 15055 states and 16992 transitions. [2025-03-03 10:52:32,024 INFO L78 Accepts]: Start accepts. Automaton has 15055 states and 16992 transitions. Word has length 585 [2025-03-03 10:52:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:32,025 INFO L471 AbstractCegarLoop]: Abstraction has 15055 states and 16992 transitions. [2025-03-03 10:52:32,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have 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:52:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 15055 states and 16992 transitions. [2025-03-03 10:52:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-03-03 10:52:32,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:32,032 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 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] [2025-03-03 10:52:32,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:52:32,032 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:32,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:32,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1957098904, now seen corresponding path program 1 times [2025-03-03 10:52:32,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:32,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922352051] [2025-03-03 10:52:32,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:32,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:32,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-03-03 10:52:32,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-03-03 10:52:32,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:32,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:32,511 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 578 proven. 39 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-03 10:52:32,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:32,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922352051] [2025-03-03 10:52:32,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922352051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:52:32,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84697596] [2025-03-03 10:52:32,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:32,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:52:32,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:52:32,514 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:52:32,516 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:52:32,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-03-03 10:52:32,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-03-03 10:52:32,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:32,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:32,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:52:32,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:52:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 578 proven. 39 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-03 10:52:33,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:52:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 578 proven. 39 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-03 10:52:33,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84697596] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:52:33,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:52:33,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-03 10:52:33,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738307877] [2025-03-03 10:52:33,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:52:33,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:52:33,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:33,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:52:33,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:52:33,997 INFO L87 Difference]: Start difference. First operand 15055 states and 16992 transitions. Second operand has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have 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:52:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:38,153 INFO L93 Difference]: Finished difference Result 38143 states and 42794 transitions. [2025-03-03 10:52:38,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 10:52:38,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 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 598 [2025-03-03 10:52:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:38,169 INFO L225 Difference]: With dead ends: 38143 [2025-03-03 10:52:38,169 INFO L226 Difference]: Without dead ends: 17747 [2025-03-03 10:52:38,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1205 GetRequests, 1191 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-03 10:52:38,183 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 2853 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5425 mSolverCounterSat, 679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2853 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 6104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 679 IncrementalHoareTripleChecker+Valid, 5425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:38,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2853 Valid, 215 Invalid, 6104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [679 Valid, 5425 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 10:52:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17747 states. [2025-03-03 10:52:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17747 to 13558. [2025-03-03 10:52:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13558 states, 13557 states have (on average 1.0706646013129748) internal successors, (14515), 13557 states have internal predecessors, (14515), 0 states have call successors, (0), 0 states have 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:52:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13558 states to 13558 states and 14515 transitions. [2025-03-03 10:52:38,344 INFO L78 Accepts]: Start accepts. Automaton has 13558 states and 14515 transitions. Word has length 598 [2025-03-03 10:52:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:38,345 INFO L471 AbstractCegarLoop]: Abstraction has 13558 states and 14515 transitions. [2025-03-03 10:52:38,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have 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:52:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand 13558 states and 14515 transitions. [2025-03-03 10:52:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-03-03 10:52:38,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:38,349 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:52:38,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:52:38,550 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,SelfDestructingSolverStorable12 [2025-03-03 10:52:38,551 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:38,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1776817743, now seen corresponding path program 1 times [2025-03-03 10:52:38,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:38,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593070261] [2025-03-03 10:52:38,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:38,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:38,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-03-03 10:52:38,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-03-03 10:52:38,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:38,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-03 10:52:38,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593070261] [2025-03-03 10:52:38,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593070261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:38,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:38,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:52:38,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067310810] [2025-03-03 10:52:38,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:38,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:38,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:38,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:38,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:38,771 INFO L87 Difference]: Start difference. First operand 13558 states and 14515 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have 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:52:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:39,455 INFO L93 Difference]: Finished difference Result 26813 states and 28725 transitions. [2025-03-03 10:52:39,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:39,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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 623 [2025-03-03 10:52:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:39,466 INFO L225 Difference]: With dead ends: 26813 [2025-03-03 10:52:39,467 INFO L226 Difference]: Without dead ends: 13556 [2025-03-03 10:52:39,470 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:52:39,471 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:39,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:52:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13556 states. [2025-03-03 10:52:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13556 to 13556. [2025-03-03 10:52:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13556 states, 13555 states have (on average 1.0705274806344522) internal successors, (14511), 13555 states have internal predecessors, (14511), 0 states have call successors, (0), 0 states have 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:52:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13556 states to 13556 states and 14511 transitions. [2025-03-03 10:52:39,565 INFO L78 Accepts]: Start accepts. Automaton has 13556 states and 14511 transitions. Word has length 623 [2025-03-03 10:52:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:39,565 INFO L471 AbstractCegarLoop]: Abstraction has 13556 states and 14511 transitions. [2025-03-03 10:52:39,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have 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:52:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 13556 states and 14511 transitions. [2025-03-03 10:52:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-03-03 10:52:39,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:39,570 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:39,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:52:39,570 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:39,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:39,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1663891854, now seen corresponding path program 1 times [2025-03-03 10:52:39,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:39,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850530141] [2025-03-03 10:52:39,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:39,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:39,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-03-03 10:52:39,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-03-03 10:52:39,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:39,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2025-03-03 10:52:40,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:40,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850530141] [2025-03-03 10:52:40,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850530141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:40,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:40,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:52:40,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223903837] [2025-03-03 10:52:40,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:40,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:40,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:40,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:40,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:40,088 INFO L87 Difference]: Start difference. First operand 13556 states and 14511 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have 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:52:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:40,737 INFO L93 Difference]: Finished difference Result 27116 states and 29027 transitions. [2025-03-03 10:52:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:40,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 639 [2025-03-03 10:52:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:40,747 INFO L225 Difference]: With dead ends: 27116 [2025-03-03 10:52:40,748 INFO L226 Difference]: Without dead ends: 13562 [2025-03-03 10:52:40,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:52:40,756 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 333 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:40,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 140 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:52:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13562 states. [2025-03-03 10:52:40,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13562 to 12659. [2025-03-03 10:52:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12659 states, 12658 states have (on average 1.0533259598672775) internal successors, (13333), 12658 states have internal predecessors, (13333), 0 states have call successors, (0), 0 states have 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:52:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 13333 transitions. [2025-03-03 10:52:40,842 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 13333 transitions. Word has length 639 [2025-03-03 10:52:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:40,843 INFO L471 AbstractCegarLoop]: Abstraction has 12659 states and 13333 transitions. [2025-03-03 10:52:40,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have 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:52:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 13333 transitions. [2025-03-03 10:52:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2025-03-03 10:52:40,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:40,847 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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:52:40,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:52:40,848 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:40,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1626248650, now seen corresponding path program 1 times [2025-03-03 10:52:40,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:40,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494208432] [2025-03-03 10:52:40,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:40,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:40,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-03-03 10:52:40,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-03-03 10:52:40,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:40,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2025-03-03 10:52:41,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:41,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494208432] [2025-03-03 10:52:41,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494208432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:41,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:41,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:52:41,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076914547] [2025-03-03 10:52:41,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:41,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:41,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:41,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:41,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:41,376 INFO L87 Difference]: Start difference. First operand 12659 states and 13333 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have 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:52:42,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:42,208 INFO L93 Difference]: Finished difference Result 27727 states and 29257 transitions. [2025-03-03 10:52:42,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:42,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 668 [2025-03-03 10:52:42,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:42,224 INFO L225 Difference]: With dead ends: 27727 [2025-03-03 10:52:42,224 INFO L226 Difference]: Without dead ends: 15070 [2025-03-03 10:52:42,234 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:52:42,235 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 310 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:42,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 134 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:52:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15070 states. [2025-03-03 10:52:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15070 to 13557. [2025-03-03 10:52:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13557 states, 13556 states have (on average 1.0542195337857776) internal successors, (14291), 13556 states have internal predecessors, (14291), 0 states have call successors, (0), 0 states have 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:52:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13557 states to 13557 states and 14291 transitions. [2025-03-03 10:52:42,347 INFO L78 Accepts]: Start accepts. Automaton has 13557 states and 14291 transitions. Word has length 668 [2025-03-03 10:52:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:42,347 INFO L471 AbstractCegarLoop]: Abstraction has 13557 states and 14291 transitions. [2025-03-03 10:52:42,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have 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:52:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 13557 states and 14291 transitions. [2025-03-03 10:52:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2025-03-03 10:52:42,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:42,353 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:52:42,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:52:42,353 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:42,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:42,353 INFO L85 PathProgramCache]: Analyzing trace with hash 952912503, now seen corresponding path program 1 times [2025-03-03 10:52:42,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:42,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438348350] [2025-03-03 10:52:42,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:42,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:42,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 675 statements into 1 equivalence classes. [2025-03-03 10:52:42,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 675 of 675 statements. [2025-03-03 10:52:42,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:42,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 566 proven. 190 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 10:52:42,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:42,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438348350] [2025-03-03 10:52:42,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438348350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:52:42,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047416361] [2025-03-03 10:52:42,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:42,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:52:42,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:52:42,961 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:52:42,963 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:52:43,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 675 statements into 1 equivalence classes. [2025-03-03 10:52:43,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 675 of 675 statements. [2025-03-03 10:52:43,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:43,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:43,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:52:43,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:52:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-03-03 10:52:43,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:52:43,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047416361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:43,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:52:43,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:52:43,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318635757] [2025-03-03 10:52:43,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:43,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:43,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:43,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:52:43,413 INFO L87 Difference]: Start difference. First operand 13557 states and 14291 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have 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:52:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:44,320 INFO L93 Difference]: Finished difference Result 28924 states and 30554 transitions. [2025-03-03 10:52:44,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:44,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 675 [2025-03-03 10:52:44,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:44,333 INFO L225 Difference]: With dead ends: 28924 [2025-03-03 10:52:44,333 INFO L226 Difference]: Without dead ends: 15369 [2025-03-03 10:52:44,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:52:44,342 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 310 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:44,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 126 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:52:44,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15369 states. [2025-03-03 10:52:44,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15369 to 12659. [2025-03-03 10:52:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12659 states, 12658 states have (on average 1.0554589982619687) internal successors, (13360), 12658 states have internal predecessors, (13360), 0 states have call successors, (0), 0 states have 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:52:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 13360 transitions. [2025-03-03 10:52:44,450 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 13360 transitions. Word has length 675 [2025-03-03 10:52:44,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:44,451 INFO L471 AbstractCegarLoop]: Abstraction has 12659 states and 13360 transitions. [2025-03-03 10:52:44,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have 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:52:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 13360 transitions. [2025-03-03 10:52:44,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2025-03-03 10:52:44,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:44,457 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:52:44,463 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:52:44,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 10:52:44,657 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:44,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:44,658 INFO L85 PathProgramCache]: Analyzing trace with hash 906135403, now seen corresponding path program 1 times [2025-03-03 10:52:44,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:44,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446464366] [2025-03-03 10:52:44,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:44,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:44,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 701 statements into 1 equivalence classes. [2025-03-03 10:52:44,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 701 of 701 statements. [2025-03-03 10:52:44,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:44,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-03-03 10:52:45,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:45,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446464366] [2025-03-03 10:52:45,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446464366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:45,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:45,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:52:45,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191946524] [2025-03-03 10:52:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:45,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:52:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:45,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:52:45,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:52:45,030 INFO L87 Difference]: Start difference. First operand 12659 states and 13360 transitions. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 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:52:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:46,157 INFO L93 Difference]: Finished difference Result 28617 states and 30334 transitions. [2025-03-03 10:52:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:52:46,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 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 701 [2025-03-03 10:52:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:46,184 INFO L225 Difference]: With dead ends: 28617 [2025-03-03 10:52:46,185 INFO L226 Difference]: Without dead ends: 16259 [2025-03-03 10:52:46,191 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:52:46,192 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 673 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:46,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 440 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:52:46,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16259 states. [2025-03-03 10:52:46,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16259 to 15063. [2025-03-03 10:52:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15063 states, 15062 states have (on average 1.0509228522108618) internal successors, (15829), 15062 states have internal predecessors, (15829), 0 states have call successors, (0), 0 states have 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:52:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15063 states to 15063 states and 15829 transitions. [2025-03-03 10:52:46,305 INFO L78 Accepts]: Start accepts. Automaton has 15063 states and 15829 transitions. Word has length 701 [2025-03-03 10:52:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:46,306 INFO L471 AbstractCegarLoop]: Abstraction has 15063 states and 15829 transitions. [2025-03-03 10:52:46,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 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:52:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 15063 states and 15829 transitions. [2025-03-03 10:52:46,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-03 10:52:46,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:46,316 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:52:46,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:52:46,316 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:46,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:46,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1003481537, now seen corresponding path program 1 times [2025-03-03 10:52:46,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:46,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872451767] [2025-03-03 10:52:46,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:46,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:46,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-03 10:52:46,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-03 10:52:46,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:46,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 772 proven. 41 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-03 10:52:47,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:47,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872451767] [2025-03-03 10:52:47,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872451767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:52:47,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947444482] [2025-03-03 10:52:47,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:47,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:52:47,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:52:47,126 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:52:47,127 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:52:47,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-03 10:52:47,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-03 10:52:47,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:47,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:47,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:52:47,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:52:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2025-03-03 10:52:47,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:52:47,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947444482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:47,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:52:47,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:52:47,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384433584] [2025-03-03 10:52:47,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:47,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:47,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:47,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:47,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:52:47,485 INFO L87 Difference]: Start difference. First operand 15063 states and 15829 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have 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:52:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:48,245 INFO L93 Difference]: Finished difference Result 36112 states and 37952 transitions. [2025-03-03 10:52:48,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:48,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 828 [2025-03-03 10:52:48,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:48,261 INFO L225 Difference]: With dead ends: 36112 [2025-03-03 10:52:48,261 INFO L226 Difference]: Without dead ends: 21051 [2025-03-03 10:52:48,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 828 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:52:48,268 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 288 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:48,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 525 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:52:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21051 states. [2025-03-03 10:52:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21051 to 18955. [2025-03-03 10:52:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18955 states, 18954 states have (on average 1.0460588793922128) internal successors, (19827), 18954 states have internal predecessors, (19827), 0 states have call successors, (0), 0 states have 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:52:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18955 states to 18955 states and 19827 transitions. [2025-03-03 10:52:48,399 INFO L78 Accepts]: Start accepts. Automaton has 18955 states and 19827 transitions. Word has length 828 [2025-03-03 10:52:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:48,399 INFO L471 AbstractCegarLoop]: Abstraction has 18955 states and 19827 transitions. [2025-03-03 10:52:48,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have 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:52:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 19827 transitions. [2025-03-03 10:52:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2025-03-03 10:52:48,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:48,411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:48,418 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:52:48,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:52:48,612 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:48,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:48,613 INFO L85 PathProgramCache]: Analyzing trace with hash -588037267, now seen corresponding path program 1 times [2025-03-03 10:52:48,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:48,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321663084] [2025-03-03 10:52:48,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:48,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:48,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 857 statements into 1 equivalence classes. [2025-03-03 10:52:48,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 857 of 857 statements. [2025-03-03 10:52:48,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:48,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1319 backedges. 745 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2025-03-03 10:52:48,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:48,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321663084] [2025-03-03 10:52:48,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321663084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:48,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:48,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:52:48,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209533000] [2025-03-03 10:52:48,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:48,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:48,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:48,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:48,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:48,959 INFO L87 Difference]: Start difference. First operand 18955 states and 19827 transitions. Second operand has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have 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:52:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:49,763 INFO L93 Difference]: Finished difference Result 40895 states and 42827 transitions. [2025-03-03 10:52:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:49,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 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 857 [2025-03-03 10:52:49,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:49,786 INFO L225 Difference]: With dead ends: 40895 [2025-03-03 10:52:49,786 INFO L226 Difference]: Without dead ends: 22241 [2025-03-03 10:52:49,798 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:52:49,799 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 96 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:49,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 166 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:52:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22241 states. [2025-03-03 10:52:49,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22241 to 20744. [2025-03-03 10:52:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20744 states, 20743 states have (on average 1.0432917128669912) internal successors, (21641), 20743 states have internal predecessors, (21641), 0 states have call successors, (0), 0 states have 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:52:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 21641 transitions. [2025-03-03 10:52:49,986 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 21641 transitions. Word has length 857 [2025-03-03 10:52:49,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:49,986 INFO L471 AbstractCegarLoop]: Abstraction has 20744 states and 21641 transitions. [2025-03-03 10:52:49,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have 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:52:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 21641 transitions. [2025-03-03 10:52:50,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 911 [2025-03-03 10:52:50,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:50,000 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:52:50,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:52:50,001 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:50,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:50,001 INFO L85 PathProgramCache]: Analyzing trace with hash -800853962, now seen corresponding path program 1 times [2025-03-03 10:52:50,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:50,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717207444] [2025-03-03 10:52:50,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:50,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:50,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 910 statements into 1 equivalence classes. [2025-03-03 10:52:50,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 910 of 910 statements. [2025-03-03 10:52:50,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:50,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2025-03-03 10:52:50,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:50,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717207444] [2025-03-03 10:52:50,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717207444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:50,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:50,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:52:50,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131021142] [2025-03-03 10:52:50,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:50,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:52:50,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:50,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:52:50,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:52:50,474 INFO L87 Difference]: Start difference. First operand 20744 states and 21641 transitions. Second operand has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have 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:52:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:51,549 INFO L93 Difference]: Finished difference Result 46574 states and 48679 transitions. [2025-03-03 10:52:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:52:51,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 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 910 [2025-03-03 10:52:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:51,575 INFO L225 Difference]: With dead ends: 46574 [2025-03-03 10:52:51,575 INFO L226 Difference]: Without dead ends: 26131 [2025-03-03 10:52:51,590 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:52:51,591 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 523 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:51,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 137 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:52:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26131 states. [2025-03-03 10:52:51,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26131 to 24633. [2025-03-03 10:52:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24633 states, 24632 states have (on average 1.0437236115621955) internal successors, (25709), 24632 states have internal predecessors, (25709), 0 states have call successors, (0), 0 states have 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:52:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24633 states to 24633 states and 25709 transitions. [2025-03-03 10:52:51,797 INFO L78 Accepts]: Start accepts. Automaton has 24633 states and 25709 transitions. Word has length 910 [2025-03-03 10:52:51,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:51,797 INFO L471 AbstractCegarLoop]: Abstraction has 24633 states and 25709 transitions. [2025-03-03 10:52:51,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have 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:52:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand 24633 states and 25709 transitions. [2025-03-03 10:52:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2025-03-03 10:52:51,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:51,809 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:52:51,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:52:51,810 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:51,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:51,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1115904030, now seen corresponding path program 1 times [2025-03-03 10:52:51,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:51,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930309192] [2025-03-03 10:52:51,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:51,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:51,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 915 statements into 1 equivalence classes. [2025-03-03 10:52:51,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 915 of 915 statements. [2025-03-03 10:52:51,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:51,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-03 10:52:52,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:52,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930309192] [2025-03-03 10:52:52,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930309192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:52,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:52,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:52:52,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569195060] [2025-03-03 10:52:52,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:52,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:52,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:52,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:52,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:52,232 INFO L87 Difference]: Start difference. First operand 24633 states and 25709 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have 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:52:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:52,967 INFO L93 Difference]: Finished difference Result 51952 states and 54265 transitions. [2025-03-03 10:52:52,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:52,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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 915 [2025-03-03 10:52:52,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:52,999 INFO L225 Difference]: With dead ends: 51952 [2025-03-03 10:52:52,999 INFO L226 Difference]: Without dead ends: 27620 [2025-03-03 10:52:53,015 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:52:53,016 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 308 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:53,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 519 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:52:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27620 states. [2025-03-03 10:52:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27620 to 22532. [2025-03-03 10:52:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22532 states, 22531 states have (on average 1.039367981891616) internal successors, (23418), 22531 states have internal predecessors, (23418), 0 states have call successors, (0), 0 states have 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:52:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 23418 transitions. [2025-03-03 10:52:53,225 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 23418 transitions. Word has length 915 [2025-03-03 10:52:53,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:53,225 INFO L471 AbstractCegarLoop]: Abstraction has 22532 states and 23418 transitions. [2025-03-03 10:52:53,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have 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:52:53,225 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 23418 transitions. [2025-03-03 10:52:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2025-03-03 10:52:53,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:53,240 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:52:53,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:52:53,240 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:53,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash 109185024, now seen corresponding path program 1 times [2025-03-03 10:52:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:53,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822109990] [2025-03-03 10:52:53,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:53,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1077 statements into 1 equivalence classes. [2025-03-03 10:52:53,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1077 of 1077 statements. [2025-03-03 10:52:53,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:53,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1867 backedges. 1459 proven. 26 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-03 10:52:54,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:54,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822109990] [2025-03-03 10:52:54,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822109990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:52:54,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871970154] [2025-03-03 10:52:54,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:54,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:52:54,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:52:54,528 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:52:54,531 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:52:54,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1077 statements into 1 equivalence classes. [2025-03-03 10:52:54,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1077 of 1077 statements. [2025-03-03 10:52:54,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:54,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:54,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:52:54,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:52:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1867 backedges. 964 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2025-03-03 10:52:57,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:52:57,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871970154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:57,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:52:57,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-03 10:52:57,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374001676] [2025-03-03 10:52:57,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:57,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:52:57,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:57,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:52:57,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:52:57,698 INFO L87 Difference]: Start difference. First operand 22532 states and 23418 transitions. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have 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:53:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:06,163 INFO L93 Difference]: Finished difference Result 53160 states and 55245 transitions. [2025-03-03 10:53:06,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:53:06,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 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 1077 [2025-03-03 10:53:06,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:06,190 INFO L225 Difference]: With dead ends: 53160 [2025-03-03 10:53:06,190 INFO L226 Difference]: Without dead ends: 30929 [2025-03-03 10:53:06,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 1076 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:53:06,201 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 420 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 153 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:06,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 140 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1544 Invalid, 11 Unknown, 0 Unchecked, 8.3s Time] [2025-03-03 10:53:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30929 states. [2025-03-03 10:53:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30929 to 23732. [2025-03-03 10:53:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23732 states, 23731 states have (on average 1.0415490286966416) internal successors, (24717), 23731 states have internal predecessors, (24717), 0 states have call successors, (0), 0 states have 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:53:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23732 states to 23732 states and 24717 transitions. [2025-03-03 10:53:06,430 INFO L78 Accepts]: Start accepts. Automaton has 23732 states and 24717 transitions. Word has length 1077 [2025-03-03 10:53:06,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:06,430 INFO L471 AbstractCegarLoop]: Abstraction has 23732 states and 24717 transitions. [2025-03-03 10:53:06,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have 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:53:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 23732 states and 24717 transitions. [2025-03-03 10:53:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1100 [2025-03-03 10:53:06,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:06,488 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:06,496 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:53:06,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:06,689 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:06,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:06,690 INFO L85 PathProgramCache]: Analyzing trace with hash -446583899, now seen corresponding path program 1 times [2025-03-03 10:53:06,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:06,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352074670] [2025-03-03 10:53:06,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:06,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:06,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1099 statements into 1 equivalence classes. [2025-03-03 10:53:06,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1099 of 1099 statements. [2025-03-03 10:53:06,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:06,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 1329 proven. 0 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2025-03-03 10:53:07,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:07,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352074670] [2025-03-03 10:53:07,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352074670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:07,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:07,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:07,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117518199] [2025-03-03 10:53:07,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:07,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:07,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:07,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:07,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:07,313 INFO L87 Difference]: Start difference. First operand 23732 states and 24717 transitions. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:53:08,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:08,134 INFO L93 Difference]: Finished difference Result 52269 states and 54446 transitions. [2025-03-03 10:53:08,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:08,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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 1099 [2025-03-03 10:53:08,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:08,196 INFO L225 Difference]: With dead ends: 52269 [2025-03-03 10:53:08,196 INFO L226 Difference]: Without dead ends: 28838 [2025-03-03 10:53:08,207 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:53:08,207 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 228 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:08,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 109 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:53:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28838 states. [2025-03-03 10:53:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28838 to 26727. [2025-03-03 10:53:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26727 states, 26726 states have (on average 1.0421312579510589) internal successors, (27852), 26726 states have internal predecessors, (27852), 0 states have call successors, (0), 0 states have 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:53:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26727 states to 26727 states and 27852 transitions. [2025-03-03 10:53:08,414 INFO L78 Accepts]: Start accepts. Automaton has 26727 states and 27852 transitions. Word has length 1099 [2025-03-03 10:53:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:08,415 INFO L471 AbstractCegarLoop]: Abstraction has 26727 states and 27852 transitions. [2025-03-03 10:53:08,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:53:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 26727 states and 27852 transitions. [2025-03-03 10:53:08,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1176 [2025-03-03 10:53:08,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:08,431 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:08,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 10:53:08,431 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:08,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:08,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1800783194, now seen corresponding path program 1 times [2025-03-03 10:53:08,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:08,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306799636] [2025-03-03 10:53:08,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:08,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:08,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1175 statements into 1 equivalence classes. [2025-03-03 10:53:08,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1175 of 1175 statements. [2025-03-03 10:53:08,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:08,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 204 proven. 1108 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2025-03-03 10:53:09,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:09,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306799636] [2025-03-03 10:53:09,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306799636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:53:09,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404251797] [2025-03-03 10:53:09,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:09,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:09,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:09,306 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:53:09,307 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:53:09,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1175 statements into 1 equivalence classes. [2025-03-03 10:53:09,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1175 of 1175 statements. [2025-03-03 10:53:09,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:09,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:09,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:53:09,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:53:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 1399 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2025-03-03 10:53:09,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:53:09,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404251797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:09,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:53:09,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:53:09,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930439136] [2025-03-03 10:53:09,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:09,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:09,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:09,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:09,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:53:09,817 INFO L87 Difference]: Start difference. First operand 26727 states and 27852 transitions. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have 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:53:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:10,573 INFO L93 Difference]: Finished difference Result 56739 states and 59072 transitions. [2025-03-03 10:53:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:10,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 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 1175 [2025-03-03 10:53:10,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:10,605 INFO L225 Difference]: With dead ends: 56739 [2025-03-03 10:53:10,606 INFO L226 Difference]: Without dead ends: 30313 [2025-03-03 10:53:10,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1178 GetRequests, 1174 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:53:10,623 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 212 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:10,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 430 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:53:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30313 states. [2025-03-03 10:53:10,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30313 to 27910. [2025-03-03 10:53:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27910 states, 27909 states have (on average 1.0388763481314272) internal successors, (28994), 27909 states have internal predecessors, (28994), 0 states have call successors, (0), 0 states have 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:53:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27910 states to 27910 states and 28994 transitions. [2025-03-03 10:53:10,959 INFO L78 Accepts]: Start accepts. Automaton has 27910 states and 28994 transitions. Word has length 1175 [2025-03-03 10:53:10,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:10,960 INFO L471 AbstractCegarLoop]: Abstraction has 27910 states and 28994 transitions. [2025-03-03 10:53:10,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have 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:53:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 27910 states and 28994 transitions. [2025-03-03 10:53:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1204 [2025-03-03 10:53:10,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:10,977 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:10,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 10:53:11,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-03 10:53:11,177 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:11,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:11,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1018262935, now seen corresponding path program 1 times [2025-03-03 10:53:11,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:11,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607386453] [2025-03-03 10:53:11,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:11,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:11,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1203 statements into 1 equivalence classes. [2025-03-03 10:53:11,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1203 of 1203 statements. [2025-03-03 10:53:11,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:11,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2283 backedges. 1085 proven. 0 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2025-03-03 10:53:12,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:12,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607386453] [2025-03-03 10:53:12,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607386453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:12,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:12,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:53:12,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328866920] [2025-03-03 10:53:12,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:12,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:53:12,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:12,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:53:12,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:53:12,212 INFO L87 Difference]: Start difference. First operand 27910 states and 28994 transitions. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have 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:53:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:13,848 INFO L93 Difference]: Finished difference Result 56418 states and 58624 transitions. [2025-03-03 10:53:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:53:13,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 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 1203 [2025-03-03 10:53:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:13,875 INFO L225 Difference]: With dead ends: 56418 [2025-03-03 10:53:13,875 INFO L226 Difference]: Without dead ends: 28809 [2025-03-03 10:53:13,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:53:13,891 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 429 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 2692 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:13,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 708 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2692 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:53:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28809 states. [2025-03-03 10:53:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28809 to 27904. [2025-03-03 10:53:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27904 states, 27903 states have (on average 1.0353008637064114) internal successors, (28888), 27903 states have internal predecessors, (28888), 0 states have call successors, (0), 0 states have 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:53:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27904 states to 27904 states and 28888 transitions. [2025-03-03 10:53:14,205 INFO L78 Accepts]: Start accepts. Automaton has 27904 states and 28888 transitions. Word has length 1203 [2025-03-03 10:53:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:14,206 INFO L471 AbstractCegarLoop]: Abstraction has 27904 states and 28888 transitions. [2025-03-03 10:53:14,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have 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:53:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 27904 states and 28888 transitions. [2025-03-03 10:53:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2025-03-03 10:53:14,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:14,223 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:53:14,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 10:53:14,223 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:14,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:14,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1453004392, now seen corresponding path program 1 times [2025-03-03 10:53:14,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:14,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222399831] [2025-03-03 10:53:14,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:14,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:14,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1229 statements into 1 equivalence classes. [2025-03-03 10:53:14,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1229 of 1229 statements. [2025-03-03 10:53:14,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:14,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2640 backedges. 1526 proven. 408 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2025-03-03 10:53:15,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:15,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222399831] [2025-03-03 10:53:15,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222399831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:53:15,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742189344] [2025-03-03 10:53:15,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:15,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:15,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:15,536 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:53:15,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:53:15,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1229 statements into 1 equivalence classes. [2025-03-03 10:53:15,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1229 of 1229 statements. [2025-03-03 10:53:15,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:15,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:15,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 1404 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:53:15,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:53:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2640 backedges. 1628 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 10:53:15,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:53:15,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742189344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:15,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:53:15,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:53:15,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102693612] [2025-03-03 10:53:15,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:15,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:15,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:15,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:15,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:53:15,952 INFO L87 Difference]: Start difference. First operand 27904 states and 28888 transitions. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:16,774 INFO L93 Difference]: Finished difference Result 54304 states and 56221 transitions. [2025-03-03 10:53:16,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:16,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1229 [2025-03-03 10:53:16,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:16,799 INFO L225 Difference]: With dead ends: 54304 [2025-03-03 10:53:16,799 INFO L226 Difference]: Without dead ends: 26701 [2025-03-03 10:53:16,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1233 GetRequests, 1230 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:53:16,817 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 194 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:16,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 488 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:53:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26701 states. [2025-03-03 10:53:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26701 to 24907. [2025-03-03 10:53:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24907 states, 24906 states have (on average 1.0232875612302257) internal successors, (25486), 24906 states have internal predecessors, (25486), 0 states have call successors, (0), 0 states have 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:53:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24907 states to 24907 states and 25486 transitions. [2025-03-03 10:53:17,058 INFO L78 Accepts]: Start accepts. Automaton has 24907 states and 25486 transitions. Word has length 1229 [2025-03-03 10:53:17,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:17,059 INFO L471 AbstractCegarLoop]: Abstraction has 24907 states and 25486 transitions. [2025-03-03 10:53:17,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:17,059 INFO L276 IsEmpty]: Start isEmpty. Operand 24907 states and 25486 transitions. [2025-03-03 10:53:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1669 [2025-03-03 10:53:17,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:17,100 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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:53:17,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 10:53:17,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 10:53:17,301 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:17,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash -276668878, now seen corresponding path program 1 times [2025-03-03 10:53:17,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:17,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746012312] [2025-03-03 10:53:17,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:17,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:17,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1668 statements into 1 equivalence classes. [2025-03-03 10:53:17,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1668 of 1668 statements. [2025-03-03 10:53:17,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:17,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6552 backedges. 2756 proven. 0 refuted. 0 times theorem prover too weak. 3796 trivial. 0 not checked. [2025-03-03 10:53:17,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:17,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746012312] [2025-03-03 10:53:17,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746012312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:17,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:17,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:17,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566511031] [2025-03-03 10:53:17,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:17,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:17,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:17,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:17,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:17,997 INFO L87 Difference]: Start difference. First operand 24907 states and 25486 transitions. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have 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:53:18,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:18,584 INFO L93 Difference]: Finished difference Result 48606 states and 49719 transitions. [2025-03-03 10:53:18,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:18,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 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 1668 [2025-03-03 10:53:18,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:18,586 INFO L225 Difference]: With dead ends: 48606 [2025-03-03 10:53:18,586 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:53:18,601 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:53:18,601 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 192 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:18,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 191 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:53:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:53:18,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:53:18,602 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:53:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:53:18,602 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1668 [2025-03-03 10:53:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:18,602 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:53:18,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have 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:53:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:53:18,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:53:18,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:53:18,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 10:53:18,613 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, 1, 1, 1, 1, 1] [2025-03-03 10:53:18,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:53:25,347 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:53:25,386 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:53:25,391 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:53:25,392 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:53:25,393 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:53:25,398 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:53:25,399 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:53:25,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:53:25 BoogieIcfgContainer [2025-03-03 10:53:25,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:53:25,407 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:53:25,407 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:53:25,407 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:53:25,411 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:52:12" (3/4) ... [2025-03-03 10:53:25,417 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:53:25,451 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-03 10:53:25,452 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:53:25,454 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:53:25,455 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:53:25,639 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:53:25,640 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:53:25,640 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:53:25,640 INFO L158 Benchmark]: Toolchain (without parser) took 76456.39ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 106.5MB in the beginning and 657.3MB in the end (delta: -550.8MB). Peak memory consumption was 447.2MB. Max. memory is 16.1GB. [2025-03-03 10:53:25,642 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:53:25,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 654.55ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 94.0MB in the end (delta: 12.3MB). Peak memory consumption was 89.7MB. Max. memory is 16.1GB. [2025-03-03 10:53:25,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.15ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 56.5MB in the end (delta: 37.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 10:53:25,643 INFO L158 Benchmark]: Boogie Preprocessor took 205.40ms. Allocated memory is still 142.6MB. Free memory was 56.5MB in the beginning and 50.8MB in the end (delta: 5.6MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2025-03-03 10:53:25,643 INFO L158 Benchmark]: IcfgBuilder took 2153.99ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 50.8MB in the beginning and 161.7MB in the end (delta: -110.9MB). Peak memory consumption was 167.1MB. Max. memory is 16.1GB. [2025-03-03 10:53:25,643 INFO L158 Benchmark]: TraceAbstraction took 73060.71ms. Allocated memory was 327.2MB in the beginning and 1.1GB in the end (delta: 813.7MB). Free memory was 161.7MB in the beginning and 682.5MB in the end (delta: -520.8MB). Peak memory consumption was 688.8MB. Max. memory is 16.1GB. [2025-03-03 10:53:25,643 INFO L158 Benchmark]: Witness Printer took 232.77ms. Allocated memory is still 1.1GB. Free memory was 682.5MB in the beginning and 657.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 10:53:25,644 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.91ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 654.55ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 94.0MB in the end (delta: 12.3MB). Peak memory consumption was 89.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 143.15ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 56.5MB in the end (delta: 37.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 205.40ms. Allocated memory is still 142.6MB. Free memory was 56.5MB in the beginning and 50.8MB in the end (delta: 5.6MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * IcfgBuilder took 2153.99ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 50.8MB in the beginning and 161.7MB in the end (delta: -110.9MB). Peak memory consumption was 167.1MB. Max. memory is 16.1GB. * TraceAbstraction took 73060.71ms. Allocated memory was 327.2MB in the beginning and 1.1GB in the end (delta: 813.7MB). Free memory was 161.7MB in the beginning and 682.5MB in the end (delta: -520.8MB). Peak memory consumption was 688.8MB. Max. memory is 16.1GB. * Witness Printer took 232.77ms. Allocated memory is still 1.1GB. Free memory was 682.5MB in the beginning and 657.3MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 146]: 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: 66.2s, OverallIterations: 28, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 40.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 10739 SdHoareTripleChecker+Valid, 36.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10739 mSDsluCounter, 10166 SdHoareTripleChecker+Invalid, 32.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1278 mSDsCounter, 4704 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31721 IncrementalHoareTripleChecker+Invalid, 36436 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4704 mSolverCounterUnsat, 8888 mSDtfsCounter, 31721 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6277 GetRequests, 6216 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27910occurred in iteration=25, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 40526 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 24561 NumberOfCodeBlocks, 24561 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 25124 ConstructedInterpolants, 283 QuantifiedInterpolants, 71928 SizeOfPredicates, 6 NumberOfNonLiveVariables, 6492 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 35 InterpolantComputations, 27 PerfectInterpolantSequences, 37458/39348 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) 97 + a0)) && (((((a29 <= 41) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (a2 == 1)) || ((((a29 <= 41) && (((long long) 42 + a4) <= 0)) && (a2 == 1)) && (((long long) a0 + 61) <= 0)))) || ((((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (a29 <= 42)) && (((long long) a0 + 61) <= 0))) || (((((long long) 89 + a4) <= 0) && (a29 <= 42)) && (a2 == 4))) || ((((long long) 89 + a4) <= 0) && (((long long) a0 + 121) <= 0))) || ((((a29 <= 41) && (((long long) 89 + a4) <= 0)) && (a2 == 1)) && (0 <= ((long long) a29 + 141)))) || (((((a29 <= 41) && (0 <= ((long long) a29 + 15))) && (0 <= ((long long) a0 + 60))) && (5 <= a2)) && (((long long) a4 + 86) <= 0))) || (((((long long) 42 + a4) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || ((((44 <= a29) && (0 <= ((long long) a0 + 60))) && (5 <= a2)) && (((long long) a4 + 86) <= 0))) || (((2 != a2) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 127) == 0))) || ((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || ((0 <= ((long long) a29 + 15)) && (((((a29 <= 41) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (a2 == 1)) || ((((a29 <= 41) && (((long long) 42 + a4) <= 0)) && (a2 == 1)) && (((long long) a0 + 61) <= 0))))) || ((((((long long) 42 + a4) <= 0) && (a29 <= 42)) && (5 <= a2)) && (((long long) a0 + 121) <= 0))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (a29 <= 42))) || ((((((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (a29 <= 42)) && (5 <= a2)) && (0 <= ((long long) a29 + 141))) && (((long long) a0 + 61) <= 0))) || ((((((long long) 42 + a4) <= 0) && (a2 == 4)) && (0 <= ((long long) 141 + a0))) && (((long long) a0 + 61) <= 0))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (a29 <= 42))) || (((((long long) 42 + a4) <= 0) && (((long long) a0 + 121) <= 0)) && (a2 == 4))) || (((((a29 <= 41) && (((long long) 42 + a4) <= 0)) && (a2 == 1)) && (((long long) a0 + 121) <= 0)) && (0 <= ((long long) a29 + 141)))) || ((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (a2 == 1)) && (((long long) a0 + 121) <= 0))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || (((a29 <= 41) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a29 + 127) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a0 + 121) <= 0))) || ((((2 == a2) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 127) <= 0))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (a2 == 4))) || (((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a29 <= 42)) && (5 <= a2))) || ((((44 <= a29) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0)) && (3 == a2))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || (((2 == a2) && (44 <= a29)) && (((long long) a0 + 386992) <= 0))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || (((((a29 <= 41) && (0 <= ((long long) a29 + 15))) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0)) && (3 == a2))) || (((((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a29 + 15))) && (a2 == 1)) && (a29 <= 401234))) || ((((2 == a2) && (44 <= a29)) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 121) <= 0))) || (((((long long) 42 + a4) <= 0) && (5 <= a2)) && (((long long) a0 + 386992) <= 0))) || (((((0 <= ((long long) 97 + a0)) && (0 <= ((long long) a29 + 15))) && (a29 <= 42)) && (((long long) a4 + 86) <= 0)) && (a2 == 4))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a29 + 141))) && (a2 == 4))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:53:25,669 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