./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_label04.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 7526302199d1f3bb6abcb37def785df856d340db371e981c5460527e95177be0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:59:03,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:59:03,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:59:03,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:59:03,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:59:03,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:59:03,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:59:03,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:59:03,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:59:03,081 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:59:03,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:59:03,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:59:03,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:59:03,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:59:03,081 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:59:03,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:59:03,082 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:59:03,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:59:03,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:59:03,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:59:03,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:59:03,083 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:59:03,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:59:03,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:59:03,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:59:03,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:59:03,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:59:03,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:59:03,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:59:03,083 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 -> 7526302199d1f3bb6abcb37def785df856d340db371e981c5460527e95177be0 [2025-03-08 01:59:03,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:59:03,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:59:03,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:59:03,328 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:59:03,328 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:59:03,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label04.c [2025-03-08 01:59:04,452 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8b1b518/7d0a920bc54b4c159592b936c5baca1c/FLAG38153b0b5 [2025-03-08 01:59:04,780 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:59:04,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label04.c [2025-03-08 01:59:04,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8b1b518/7d0a920bc54b4c159592b936c5baca1c/FLAG38153b0b5 [2025-03-08 01:59:04,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8b1b518/7d0a920bc54b4c159592b936c5baca1c [2025-03-08 01:59:04,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:59:04,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:59:04,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:59:04,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:59:04,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:59:04,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:59:04" (1/1) ... [2025-03-08 01:59:04,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ee2081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:04, skipping insertion in model container [2025-03-08 01:59:04,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:59:04" (1/1) ... [2025-03-08 01:59:04,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:59:05,021 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_label04.c[3915,3928] [2025-03-08 01:59:05,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:59:05,307 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:59:05,323 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_label04.c[3915,3928] [2025-03-08 01:59:05,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:59:05,449 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:59:05,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:05 WrapperNode [2025-03-08 01:59:05,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:59:05,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:59:05,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:59:05,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:59:05,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:05" (1/1) ... [2025-03-08 01:59:05,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:05" (1/1) ... [2025-03-08 01:59:05,618 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-08 01:59:05,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:59:05,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:59:05,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:59:05,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:59:05,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:05" (1/1) ... [2025-03-08 01:59:05,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:05" (1/1) ... [2025-03-08 01:59:05,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:05" (1/1) ... [2025-03-08 01:59:05,745 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-08 01:59:05,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:05" (1/1) ... [2025-03-08 01:59:05,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:05" (1/1) ... [2025-03-08 01:59:05,789 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:05" (1/1) ... [2025-03-08 01:59:05,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:05" (1/1) ... [2025-03-08 01:59:05,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:05" (1/1) ... [2025-03-08 01:59:05,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:05" (1/1) ... [2025-03-08 01:59:05,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:59:05,842 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:59:05,843 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:59:05,843 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:59:05,844 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:05" (1/1) ... [2025-03-08 01:59:05,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:59:05,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:59:05,873 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-08 01:59:05,878 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-08 01:59:05,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:59:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:59:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:59:05,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:59:05,943 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:59:05,945 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:59:07,932 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-08 01:59:08,034 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-08 01:59:08,034 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:59:08,055 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:59:08,055 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:59:08,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:59:08 BoogieIcfgContainer [2025-03-08 01:59:08,055 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:59:08,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:59:08,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:59:08,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:59:08,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:59:04" (1/3) ... [2025-03-08 01:59:08,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2a3755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:59:08, skipping insertion in model container [2025-03-08 01:59:08,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:59:05" (2/3) ... [2025-03-08 01:59:08,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2a3755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:59:08, skipping insertion in model container [2025-03-08 01:59:08,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:59:08" (3/3) ... [2025-03-08 01:59:08,066 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label04.c [2025-03-08 01:59:08,079 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:59:08,080 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label04.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:59:08,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:59:08,173 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;@1245735e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:59:08,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:59:08,178 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-08 01:59:08,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 01:59:08,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:08,184 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] [2025-03-08 01:59:08,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:08,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1376121970, now seen corresponding path program 1 times [2025-03-08 01:59:08,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:08,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020815032] [2025-03-08 01:59:08,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:08,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:08,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 01:59:08,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 01:59:08,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:08,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:08,432 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-08 01:59:08,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:08,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020815032] [2025-03-08 01:59:08,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020815032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:08,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:08,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:59:08,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270077249] [2025-03-08 01:59:08,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:08,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:08,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:08,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:08,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:08,479 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 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:09,939 INFO L93 Difference]: Finished difference Result 1155 states and 2103 transitions. [2025-03-08 01:59:09,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:09,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-08 01:59:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:09,953 INFO L225 Difference]: With dead ends: 1155 [2025-03-08 01:59:09,953 INFO L226 Difference]: Without dead ends: 667 [2025-03-08 01:59:09,956 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-08 01:59:09,958 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 313 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:09,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 370 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 01:59:09,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-08 01:59:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2025-03-08 01:59:09,993 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-08 01:59:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2025-03-08 01:59:09,997 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 31 [2025-03-08 01:59:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:09,997 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2025-03-08 01:59:09,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2025-03-08 01:59:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 01:59:09,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:10,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:59:10,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:59:10,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:10,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:10,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1331654827, now seen corresponding path program 1 times [2025-03-08 01:59:10,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:10,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136613399] [2025-03-08 01:59:10,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:10,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:10,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 01:59:10,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 01:59:10,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:10,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:59:10,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:10,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136613399] [2025-03-08 01:59:10,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136613399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:10,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:10,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:59:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727797533] [2025-03-08 01:59:10,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:10,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:10,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:10,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:10,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:10,232 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:11,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:11,610 INFO L93 Difference]: Finished difference Result 1955 states and 2894 transitions. [2025-03-08 01:59:11,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:11,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-08 01:59:11,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:11,616 INFO L225 Difference]: With dead ends: 1955 [2025-03-08 01:59:11,616 INFO L226 Difference]: Without dead ends: 1292 [2025-03-08 01:59:11,619 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-08 01:59:11,620 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:11,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 325 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 01:59:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-03-08 01:59:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1282. [2025-03-08 01:59:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 1.3989071038251366) internal successors, (1792), 1281 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1792 transitions. [2025-03-08 01:59:11,661 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1792 transitions. Word has length 106 [2025-03-08 01:59:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:11,661 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1792 transitions. [2025-03-08 01:59:11,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1792 transitions. [2025-03-08 01:59:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 01:59:11,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:11,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:59:11,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:59:11,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:11,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:11,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1501983371, now seen corresponding path program 1 times [2025-03-08 01:59:11,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:11,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033334418] [2025-03-08 01:59:11,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:11,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:11,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 01:59:11,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 01:59:11,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:11,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:59:11,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:11,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033334418] [2025-03-08 01:59:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033334418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:11,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:11,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:59:11,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331928975] [2025-03-08 01:59:11,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:11,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:11,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:11,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:11,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:11,830 INFO L87 Difference]: Start difference. First operand 1282 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:12,942 INFO L93 Difference]: Finished difference Result 3766 states and 5264 transitions. [2025-03-08 01:59:12,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:12,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-08 01:59:12,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:12,955 INFO L225 Difference]: With dead ends: 3766 [2025-03-08 01:59:12,955 INFO L226 Difference]: Without dead ends: 2486 [2025-03-08 01:59:12,957 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-08 01:59:12,957 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-08 01:59:12,958 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-08 01:59:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-03-08 01:59:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2182. [2025-03-08 01:59:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2181 states have (on average 1.2824392480513527) internal successors, (2797), 2181 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2797 transitions. [2025-03-08 01:59:13,001 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2797 transitions. Word has length 110 [2025-03-08 01:59:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:13,001 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 2797 transitions. [2025-03-08 01:59:13,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2797 transitions. [2025-03-08 01:59:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-08 01:59:13,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:13,004 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:59:13,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:59:13,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:13,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:13,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1179732484, now seen corresponding path program 1 times [2025-03-08 01:59:13,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:13,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162677113] [2025-03-08 01:59:13,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:13,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:13,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 01:59:13,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 01:59:13,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:13,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:59:13,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:13,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162677113] [2025-03-08 01:59:13,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162677113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:13,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:13,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:59:13,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974779959] [2025-03-08 01:59:13,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:13,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:13,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:13,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:13,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:13,266 INFO L87 Difference]: Start difference. First operand 2182 states and 2797 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:14,362 INFO L93 Difference]: Finished difference Result 5567 states and 7272 transitions. [2025-03-08 01:59:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:14,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-08 01:59:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:14,371 INFO L225 Difference]: With dead ends: 5567 [2025-03-08 01:59:14,372 INFO L226 Difference]: Without dead ends: 3387 [2025-03-08 01:59:14,374 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-08 01:59:14,374 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 297 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:14,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 614 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 01:59:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2025-03-08 01:59:14,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3385. [2025-03-08 01:59:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.2166075650118204) internal successors, (4117), 3384 states have internal predecessors, (4117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4117 transitions. [2025-03-08 01:59:14,421 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4117 transitions. Word has length 227 [2025-03-08 01:59:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:14,421 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 4117 transitions. [2025-03-08 01:59:14,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4117 transitions. [2025-03-08 01:59:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-08 01:59:14,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:14,424 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:59:14,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:59:14,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:14,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash -322299160, now seen corresponding path program 1 times [2025-03-08 01:59:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:14,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468073311] [2025-03-08 01:59:14,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:14,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:14,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-08 01:59:14,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-08 01:59:14,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:14,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 01:59:14,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:14,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468073311] [2025-03-08 01:59:14,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468073311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:14,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:14,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:59:14,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337034040] [2025-03-08 01:59:14,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:14,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:14,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:14,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:14,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:14,684 INFO L87 Difference]: Start difference. First operand 3385 states and 4117 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:15,802 INFO L93 Difference]: Finished difference Result 8870 states and 10893 transitions. [2025-03-08 01:59:15,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:15,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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 301 [2025-03-08 01:59:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:15,819 INFO L225 Difference]: With dead ends: 8870 [2025-03-08 01:59:15,819 INFO L226 Difference]: Without dead ends: 5487 [2025-03-08 01:59:15,823 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-08 01:59:15,824 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 43 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:15,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 316 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 01:59:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5487 states. [2025-03-08 01:59:15,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5487 to 5484. [2025-03-08 01:59:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5484 states, 5483 states have (on average 1.1756337771293088) internal successors, (6446), 5483 states have internal predecessors, (6446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 6446 transitions. [2025-03-08 01:59:15,892 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 6446 transitions. Word has length 301 [2025-03-08 01:59:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:15,892 INFO L471 AbstractCegarLoop]: Abstraction has 5484 states and 6446 transitions. [2025-03-08 01:59:15,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 6446 transitions. [2025-03-08 01:59:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-08 01:59:15,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:15,896 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 01:59:15,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:59:15,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:15,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:15,897 INFO L85 PathProgramCache]: Analyzing trace with hash 633333053, now seen corresponding path program 1 times [2025-03-08 01:59:15,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:15,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444191424] [2025-03-08 01:59:15,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:15,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:15,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-08 01:59:15,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-08 01:59:15,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:15,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-08 01:59:16,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:16,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444191424] [2025-03-08 01:59:16,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444191424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:16,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:16,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:59:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17208160] [2025-03-08 01:59:16,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:16,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:16,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:16,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:16,167 INFO L87 Difference]: Start difference. First operand 5484 states and 6446 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:17,390 INFO L93 Difference]: Finished difference Result 13065 states and 15605 transitions. [2025-03-08 01:59:17,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:17,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 377 [2025-03-08 01:59:17,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:17,406 INFO L225 Difference]: With dead ends: 13065 [2025-03-08 01:59:17,406 INFO L226 Difference]: Without dead ends: 7583 [2025-03-08 01:59:17,411 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-08 01:59:17,411 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 296 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 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-08 01:59:17,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 641 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 01:59:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2025-03-08 01:59:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 6985. [2025-03-08 01:59:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6985 states, 6984 states have (on average 1.154209621993127) internal successors, (8061), 6984 states have internal predecessors, (8061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6985 states to 6985 states and 8061 transitions. [2025-03-08 01:59:17,529 INFO L78 Accepts]: Start accepts. Automaton has 6985 states and 8061 transitions. Word has length 377 [2025-03-08 01:59:17,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:17,529 INFO L471 AbstractCegarLoop]: Abstraction has 6985 states and 8061 transitions. [2025-03-08 01:59:17,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6985 states and 8061 transitions. [2025-03-08 01:59:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-08 01:59:17,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:17,538 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:59:17,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:59:17,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:17,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:17,539 INFO L85 PathProgramCache]: Analyzing trace with hash 970062, now seen corresponding path program 1 times [2025-03-08 01:59:17,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:17,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880784733] [2025-03-08 01:59:17,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:17,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:17,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-08 01:59:17,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-08 01:59:17,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:17,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 01:59:17,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:17,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880784733] [2025-03-08 01:59:17,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880784733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:17,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:17,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:59:17,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307001533] [2025-03-08 01:59:17,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:17,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:17,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:17,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:17,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:17,823 INFO L87 Difference]: Start difference. First operand 6985 states and 8061 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:18,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:18,992 INFO L93 Difference]: Finished difference Result 16659 states and 19427 transitions. [2025-03-08 01:59:18,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:18,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 392 [2025-03-08 01:59:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:19,017 INFO L225 Difference]: With dead ends: 16659 [2025-03-08 01:59:19,017 INFO L226 Difference]: Without dead ends: 9676 [2025-03-08 01:59:19,022 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-08 01:59:19,023 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 285 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:19,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 315 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 01:59:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9676 states. [2025-03-08 01:59:19,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9676 to 6381. [2025-03-08 01:59:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6381 states, 6380 states have (on average 1.1637931034482758) internal successors, (7425), 6380 states have internal predecessors, (7425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6381 states to 6381 states and 7425 transitions. [2025-03-08 01:59:19,115 INFO L78 Accepts]: Start accepts. Automaton has 6381 states and 7425 transitions. Word has length 392 [2025-03-08 01:59:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:19,115 INFO L471 AbstractCegarLoop]: Abstraction has 6381 states and 7425 transitions. [2025-03-08 01:59:19,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 6381 states and 7425 transitions. [2025-03-08 01:59:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-03-08 01:59:19,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:19,120 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 01:59:19,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:59:19,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:19,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:19,122 INFO L85 PathProgramCache]: Analyzing trace with hash 775703844, now seen corresponding path program 1 times [2025-03-08 01:59:19,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:19,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636831662] [2025-03-08 01:59:19,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:19,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:19,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-08 01:59:19,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-08 01:59:19,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:19,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:59:19,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:19,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636831662] [2025-03-08 01:59:19,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636831662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:19,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:19,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:59:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374635607] [2025-03-08 01:59:19,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:19,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:19,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:19,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:19,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:19,351 INFO L87 Difference]: Start difference. First operand 6381 states and 7425 transitions. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:20,535 INFO L93 Difference]: Finished difference Result 14560 states and 17233 transitions. [2025-03-08 01:59:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:20,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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 394 [2025-03-08 01:59:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:20,552 INFO L225 Difference]: With dead ends: 14560 [2025-03-08 01:59:20,552 INFO L226 Difference]: Without dead ends: 8181 [2025-03-08 01:59:20,558 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-08 01:59:20,559 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 248 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:20,559 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.1s Time] [2025-03-08 01:59:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8181 states. [2025-03-08 01:59:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8181 to 7578. [2025-03-08 01:59:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 7577 states have (on average 1.149795433548898) internal successors, (8712), 7577 states have internal predecessors, (8712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 8712 transitions. [2025-03-08 01:59:20,629 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 8712 transitions. Word has length 394 [2025-03-08 01:59:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:20,629 INFO L471 AbstractCegarLoop]: Abstraction has 7578 states and 8712 transitions. [2025-03-08 01:59:20,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 8712 transitions. [2025-03-08 01:59:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-03-08 01:59:20,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:20,633 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-08 01:59:20,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:59:20,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:20,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash -368624290, now seen corresponding path program 1 times [2025-03-08 01:59:20,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:20,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397212106] [2025-03-08 01:59:20,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:20,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:20,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-03-08 01:59:20,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-03-08 01:59:20,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:20,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-08 01:59:21,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:21,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397212106] [2025-03-08 01:59:21,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397212106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:21,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:21,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:59:21,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268566542] [2025-03-08 01:59:21,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:21,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:21,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:21,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:21,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:21,186 INFO L87 Difference]: Start difference. First operand 7578 states and 8712 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-08 01:59:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:22,214 INFO L93 Difference]: Finished difference Result 15453 states and 17733 transitions. [2025-03-08 01:59:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:22,215 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 421 [2025-03-08 01:59:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:22,231 INFO L225 Difference]: With dead ends: 15453 [2025-03-08 01:59:22,232 INFO L226 Difference]: Without dead ends: 7877 [2025-03-08 01:59:22,238 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-08 01:59:22,239 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, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:22,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 354 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 01:59:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7877 states. [2025-03-08 01:59:22,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7877 to 7877. [2025-03-08 01:59:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7877 states, 7876 states have (on average 1.1448704926358557) internal successors, (9017), 7876 states have internal predecessors, (9017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7877 states to 7877 states and 9017 transitions. [2025-03-08 01:59:22,333 INFO L78 Accepts]: Start accepts. Automaton has 7877 states and 9017 transitions. Word has length 421 [2025-03-08 01:59:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:22,334 INFO L471 AbstractCegarLoop]: Abstraction has 7877 states and 9017 transitions. [2025-03-08 01:59:22,334 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-08 01:59:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 7877 states and 9017 transitions. [2025-03-08 01:59:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-03-08 01:59:22,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:22,340 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-08 01:59:22,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:59:22,340 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:22,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash -930285750, now seen corresponding path program 1 times [2025-03-08 01:59:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:22,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841791710] [2025-03-08 01:59:22,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:22,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:22,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-08 01:59:22,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-08 01:59:22,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:22,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-03-08 01:59:22,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:22,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841791710] [2025-03-08 01:59:22,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841791710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:22,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:22,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:59:22,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822218409] [2025-03-08 01:59:22,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:22,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:22,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:22,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:22,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:22,505 INFO L87 Difference]: Start difference. First operand 7877 states and 9017 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:23,608 INFO L93 Difference]: Finished difference Result 17844 states and 20684 transitions. [2025-03-08 01:59:23,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:23,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 495 [2025-03-08 01:59:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:23,620 INFO L225 Difference]: With dead ends: 17844 [2025-03-08 01:59:23,620 INFO L226 Difference]: Without dead ends: 10268 [2025-03-08 01:59:23,625 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-08 01:59:23,626 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 384 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:23,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 446 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 01:59:23,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10268 states. [2025-03-08 01:59:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10268 to 10268. [2025-03-08 01:59:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10268 states, 10267 states have (on average 1.1469757475406643) internal successors, (11776), 10267 states have internal predecessors, (11776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 11776 transitions. [2025-03-08 01:59:23,708 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 11776 transitions. Word has length 495 [2025-03-08 01:59:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:23,709 INFO L471 AbstractCegarLoop]: Abstraction has 10268 states and 11776 transitions. [2025-03-08 01:59:23,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 11776 transitions. [2025-03-08 01:59:23,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-03-08 01:59:23,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:23,712 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-08 01:59:23,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 01:59:23,713 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:23,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:23,713 INFO L85 PathProgramCache]: Analyzing trace with hash 292415054, now seen corresponding path program 1 times [2025-03-08 01:59:23,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:23,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774963239] [2025-03-08 01:59:23,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:23,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:23,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-08 01:59:23,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-08 01:59:23,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:23,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-08 01:59:23,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:23,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774963239] [2025-03-08 01:59:23,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774963239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:23,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:23,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:59:23,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968214950] [2025-03-08 01:59:23,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:23,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:24,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:24,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:24,000 INFO L87 Difference]: Start difference. First operand 10268 states and 11776 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:25,078 INFO L93 Difference]: Finished difference Result 25033 states and 28940 transitions. [2025-03-08 01:59:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:25,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 519 [2025-03-08 01:59:25,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:25,097 INFO L225 Difference]: With dead ends: 25033 [2025-03-08 01:59:25,097 INFO L226 Difference]: Without dead ends: 15066 [2025-03-08 01:59:25,107 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-08 01:59:25,108 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 623 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:25,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 623 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 01:59:25,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15066 states. [2025-03-08 01:59:25,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15066 to 14457. [2025-03-08 01:59:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14457 states, 14456 states have (on average 1.1329551743220807) internal successors, (16378), 14456 states have internal predecessors, (16378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14457 states to 14457 states and 16378 transitions. [2025-03-08 01:59:25,236 INFO L78 Accepts]: Start accepts. Automaton has 14457 states and 16378 transitions. Word has length 519 [2025-03-08 01:59:25,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:25,236 INFO L471 AbstractCegarLoop]: Abstraction has 14457 states and 16378 transitions. [2025-03-08 01:59:25,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 14457 states and 16378 transitions. [2025-03-08 01:59:25,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-03-08 01:59:25,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:25,242 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-08 01:59:25,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:59:25,243 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:25,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:25,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1093226554, now seen corresponding path program 1 times [2025-03-08 01:59:25,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:25,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090003826] [2025-03-08 01:59:25,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:25,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:25,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-08 01:59:25,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-08 01:59:25,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:25,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 554 proven. 39 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-08 01:59:25,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:25,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090003826] [2025-03-08 01:59:25,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090003826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:59:25,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814301326] [2025-03-08 01:59:25,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:25,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:59:25,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:59:25,710 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-08 01:59:25,711 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-08 01:59:25,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-08 01:59:25,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-08 01:59:25,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:25,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:25,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 01:59:25,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:59:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 554 proven. 39 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-08 01:59:26,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 01:59:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 554 proven. 39 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-08 01:59:27,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814301326] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 01:59:27,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 01:59:27,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-08 01:59:27,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941463359] [2025-03-08 01:59:27,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 01:59:27,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 01:59:27,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:27,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 01:59:27,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:59:27,149 INFO L87 Difference]: Start difference. First operand 14457 states and 16378 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-08 01:59:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:31,381 INFO L93 Difference]: Finished difference Result 36947 states and 41592 transitions. [2025-03-08 01:59:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 01:59:31,382 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 586 [2025-03-08 01:59:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:31,404 INFO L225 Difference]: With dead ends: 36947 [2025-03-08 01:59:31,404 INFO L226 Difference]: Without dead ends: 17149 [2025-03-08 01:59:31,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1181 GetRequests, 1167 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-08 01:59:31,414 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 3101 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 5790 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3101 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 6477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 5790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:31,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3101 Valid, 267 Invalid, 6477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 5790 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-08 01:59:31,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17149 states. [2025-03-08 01:59:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17149 to 12661. [2025-03-08 01:59:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12661 states, 12660 states have (on average 1.0695102685624012) internal successors, (13540), 12660 states have internal predecessors, (13540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12661 states to 12661 states and 13540 transitions. [2025-03-08 01:59:31,572 INFO L78 Accepts]: Start accepts. Automaton has 12661 states and 13540 transitions. Word has length 586 [2025-03-08 01:59:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:31,573 INFO L471 AbstractCegarLoop]: Abstraction has 12661 states and 13540 transitions. [2025-03-08 01:59:31,573 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-08 01:59:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 12661 states and 13540 transitions. [2025-03-08 01:59:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2025-03-08 01:59:31,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:31,578 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-08 01:59:31,585 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-08 01:59:31,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 01:59:31,779 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:31,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:31,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1363819395, now seen corresponding path program 1 times [2025-03-08 01:59:31,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:31,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953522729] [2025-03-08 01:59:31,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:31,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:31,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-03-08 01:59:31,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-03-08 01:59:31,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:31,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-03-08 01:59:32,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:32,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953522729] [2025-03-08 01:59:32,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953522729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:32,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:32,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:59:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628840940] [2025-03-08 01:59:32,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:32,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:32,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:32,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:32,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:32,009 INFO L87 Difference]: Start difference. First operand 12661 states and 13540 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-08 01:59:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:32,628 INFO L93 Difference]: Finished difference Result 25318 states and 27088 transitions. [2025-03-08 01:59:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:32,628 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 611 [2025-03-08 01:59:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:32,639 INFO L225 Difference]: With dead ends: 25318 [2025-03-08 01:59:32,639 INFO L226 Difference]: Without dead ends: 12958 [2025-03-08 01:59:32,646 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-08 01:59:32,647 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:32,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:59:32,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12958 states. [2025-03-08 01:59:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12958 to 12659. [2025-03-08 01:59:32,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12659 states, 12658 states have (on average 1.0693632485384736) internal successors, (13536), 12658 states have internal predecessors, (13536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 13536 transitions. [2025-03-08 01:59:32,743 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 13536 transitions. Word has length 611 [2025-03-08 01:59:32,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:32,743 INFO L471 AbstractCegarLoop]: Abstraction has 12659 states and 13536 transitions. [2025-03-08 01:59:32,744 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-08 01:59:32,744 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 13536 transitions. [2025-03-08 01:59:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-03-08 01:59:32,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:32,748 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:59:32,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 01:59:32,748 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:32,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:32,749 INFO L85 PathProgramCache]: Analyzing trace with hash -785343486, now seen corresponding path program 1 times [2025-03-08 01:59:32,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:32,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094080649] [2025-03-08 01:59:32,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:32,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-03-08 01:59:32,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-03-08 01:59:32,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:32,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-08 01:59:33,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:33,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094080649] [2025-03-08 01:59:33,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094080649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:33,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:33,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:59:33,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291403241] [2025-03-08 01:59:33,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:33,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:33,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:33,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:33,253 INFO L87 Difference]: Start difference. First operand 12659 states and 13536 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:33,948 INFO L93 Difference]: Finished difference Result 25322 states and 27077 transitions. [2025-03-08 01:59:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:33,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 632 [2025-03-08 01:59:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:33,963 INFO L225 Difference]: With dead ends: 25322 [2025-03-08 01:59:33,963 INFO L226 Difference]: Without dead ends: 12665 [2025-03-08 01:59:33,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-08 01:59:33,972 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 344 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:33,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 138 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:59:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12665 states. [2025-03-08 01:59:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12665 to 12061. [2025-03-08 01:59:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12061 states, 12060 states have (on average 1.055721393034826) internal successors, (12732), 12060 states have internal predecessors, (12732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12061 states to 12061 states and 12732 transitions. [2025-03-08 01:59:34,108 INFO L78 Accepts]: Start accepts. Automaton has 12061 states and 12732 transitions. Word has length 632 [2025-03-08 01:59:34,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:34,108 INFO L471 AbstractCegarLoop]: Abstraction has 12061 states and 12732 transitions. [2025-03-08 01:59:34,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 12061 states and 12732 transitions. [2025-03-08 01:59:34,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2025-03-08 01:59:34,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:34,116 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-08 01:59:34,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 01:59:34,116 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:34,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:34,117 INFO L85 PathProgramCache]: Analyzing trace with hash 718088904, now seen corresponding path program 1 times [2025-03-08 01:59:34,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:34,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833941368] [2025-03-08 01:59:34,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:34,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:34,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-03-08 01:59:34,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-03-08 01:59:34,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:34,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2025-03-08 01:59:34,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:34,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833941368] [2025-03-08 01:59:34,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833941368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:34,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:34,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:59:34,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634435952] [2025-03-08 01:59:34,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:34,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:34,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:34,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:34,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:34,380 INFO L87 Difference]: Start difference. First operand 12061 states and 12732 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:35,120 INFO L93 Difference]: Finished difference Result 27107 states and 28671 transitions. [2025-03-08 01:59:35,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:35,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 656 [2025-03-08 01:59:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:35,133 INFO L225 Difference]: With dead ends: 27107 [2025-03-08 01:59:35,133 INFO L226 Difference]: Without dead ends: 15048 [2025-03-08 01:59:35,145 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-08 01:59:35,146 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 305 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:35,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 183 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:59:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15048 states. [2025-03-08 01:59:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15048 to 14150. [2025-03-08 01:59:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14150 states, 14149 states have (on average 1.0499681956322002) internal successors, (14856), 14149 states have internal predecessors, (14856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 14856 transitions. [2025-03-08 01:59:35,284 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 14856 transitions. Word has length 656 [2025-03-08 01:59:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:35,285 INFO L471 AbstractCegarLoop]: Abstraction has 14150 states and 14856 transitions. [2025-03-08 01:59:35,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 14856 transitions. [2025-03-08 01:59:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-03-08 01:59:35,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:35,290 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-08 01:59:35,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 01:59:35,290 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:35,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:35,290 INFO L85 PathProgramCache]: Analyzing trace with hash -635294007, now seen corresponding path program 1 times [2025-03-08 01:59:35,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:35,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123620390] [2025-03-08 01:59:35,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:35,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:35,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-08 01:59:35,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-08 01:59:35,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:35,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 530 proven. 190 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 01:59:35,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:35,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123620390] [2025-03-08 01:59:35,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123620390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:59:35,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935537713] [2025-03-08 01:59:35,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:35,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:59:35,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:59:35,750 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-08 01:59:35,751 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-08 01:59:35,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-08 01:59:35,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-08 01:59:35,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:35,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:35,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:59:35,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:59:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-03-08 01:59:36,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:59:36,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935537713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:36,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:59:36,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 01:59:36,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622697887] [2025-03-08 01:59:36,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:36,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:36,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:36,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:36,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:59:36,169 INFO L87 Difference]: Start difference. First operand 14150 states and 14856 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:37,105 INFO L93 Difference]: Finished difference Result 32806 states and 34515 transitions. [2025-03-08 01:59:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:37,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 663 [2025-03-08 01:59:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:37,123 INFO L225 Difference]: With dead ends: 32806 [2025-03-08 01:59:37,123 INFO L226 Difference]: Without dead ends: 18658 [2025-03-08 01:59:37,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:59:37,133 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 309 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:37,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 482 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 01:59:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18658 states. [2025-03-08 01:59:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18658 to 18647. [2025-03-08 01:59:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18647 states, 18646 states have (on average 1.049018556258715) internal successors, (19560), 18646 states have internal predecessors, (19560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18647 states to 18647 states and 19560 transitions. [2025-03-08 01:59:37,265 INFO L78 Accepts]: Start accepts. Automaton has 18647 states and 19560 transitions. Word has length 663 [2025-03-08 01:59:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:37,265 INFO L471 AbstractCegarLoop]: Abstraction has 18647 states and 19560 transitions. [2025-03-08 01:59:37,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 18647 states and 19560 transitions. [2025-03-08 01:59:37,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2025-03-08 01:59:37,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:37,301 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:59:37,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 01:59:37,502 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,SelfDestructingSolverStorable15 [2025-03-08 01:59:37,502 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:37,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:37,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1458708331, now seen corresponding path program 1 times [2025-03-08 01:59:37,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:37,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837623689] [2025-03-08 01:59:37,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:37,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:37,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-03-08 01:59:37,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-03-08 01:59:37,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:37,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 462 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 01:59:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:37,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837623689] [2025-03-08 01:59:37,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837623689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:37,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:37,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:59:37,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151506521] [2025-03-08 01:59:37,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:37,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:37,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:37,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:37,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:37,827 INFO L87 Difference]: Start difference. First operand 18647 states and 19560 transitions. Second operand has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:38,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:38,719 INFO L93 Difference]: Finished difference Result 42973 states and 45192 transitions. [2025-03-08 01:59:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:38,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 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 697 [2025-03-08 01:59:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:38,744 INFO L225 Difference]: With dead ends: 42973 [2025-03-08 01:59:38,744 INFO L226 Difference]: Without dead ends: 24328 [2025-03-08 01:59:38,754 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-08 01:59:38,754 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 65 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:38,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 159 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:59:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24328 states. [2025-03-08 01:59:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24328 to 22833. [2025-03-08 01:59:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22833 states, 22832 states have (on average 1.047959004905396) internal successors, (23927), 22832 states have internal predecessors, (23927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22833 states to 22833 states and 23927 transitions. [2025-03-08 01:59:39,009 INFO L78 Accepts]: Start accepts. Automaton has 22833 states and 23927 transitions. Word has length 697 [2025-03-08 01:59:39,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:39,009 INFO L471 AbstractCegarLoop]: Abstraction has 22833 states and 23927 transitions. [2025-03-08 01:59:39,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:39,009 INFO L276 IsEmpty]: Start isEmpty. Operand 22833 states and 23927 transitions. [2025-03-08 01:59:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2025-03-08 01:59:39,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:39,020 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:59:39,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 01:59:39,020 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:39,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:39,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1203920606, now seen corresponding path program 1 times [2025-03-08 01:59:39,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:39,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022043668] [2025-03-08 01:59:39,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:39,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:39,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 713 statements into 1 equivalence classes. [2025-03-08 01:59:39,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 713 of 713 statements. [2025-03-08 01:59:39,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:39,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-03-08 01:59:39,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:39,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022043668] [2025-03-08 01:59:39,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022043668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:39,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:39,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:59:39,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445884262] [2025-03-08 01:59:39,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:39,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:39,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:39,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:39,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:39,344 INFO L87 Difference]: Start difference. First operand 22833 states and 23927 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:40,127 INFO L93 Difference]: Finished difference Result 45970 states and 48160 transitions. [2025-03-08 01:59:40,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:40,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 713 [2025-03-08 01:59:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:40,147 INFO L225 Difference]: With dead ends: 45970 [2025-03-08 01:59:40,147 INFO L226 Difference]: Without dead ends: 23139 [2025-03-08 01:59:40,157 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-08 01:59:40,157 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 293 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:40,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 529 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:59:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23139 states. [2025-03-08 01:59:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23139 to 22533. [2025-03-08 01:59:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.0469554411503639) internal successors, (23590), 22532 states have internal predecessors, (23590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 23590 transitions. [2025-03-08 01:59:40,307 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 23590 transitions. Word has length 713 [2025-03-08 01:59:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:40,308 INFO L471 AbstractCegarLoop]: Abstraction has 22533 states and 23590 transitions. [2025-03-08 01:59:40,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 23590 transitions. [2025-03-08 01:59:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2025-03-08 01:59:40,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:40,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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 01:59:40,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 01:59:40,316 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:40,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:40,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1614486015, now seen corresponding path program 1 times [2025-03-08 01:59:40,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:40,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812100139] [2025-03-08 01:59:40,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:40,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:40,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-03-08 01:59:40,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-03-08 01:59:40,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:40,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:40,757 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-08 01:59:40,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:40,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812100139] [2025-03-08 01:59:40,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812100139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:40,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:40,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:59:40,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834340027] [2025-03-08 01:59:40,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:40,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:40,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:40,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:40,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:40,758 INFO L87 Difference]: Start difference. First operand 22533 states and 23590 transitions. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:41,451 INFO L93 Difference]: Finished difference Result 48667 states and 51077 transitions. [2025-03-08 01:59:41,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:41,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 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 727 [2025-03-08 01:59:41,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:41,475 INFO L225 Difference]: With dead ends: 48667 [2025-03-08 01:59:41,475 INFO L226 Difference]: Without dead ends: 26435 [2025-03-08 01:59:41,487 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-08 01:59:41,487 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 173 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:41,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 545 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:59:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26435 states. [2025-03-08 01:59:41,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26435 to 25537. [2025-03-08 01:59:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25537 states, 25536 states have (on average 1.0446428571428572) internal successors, (26676), 25536 states have internal predecessors, (26676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25537 states to 25537 states and 26676 transitions. [2025-03-08 01:59:41,675 INFO L78 Accepts]: Start accepts. Automaton has 25537 states and 26676 transitions. Word has length 727 [2025-03-08 01:59:41,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:41,675 INFO L471 AbstractCegarLoop]: Abstraction has 25537 states and 26676 transitions. [2025-03-08 01:59:41,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 25537 states and 26676 transitions. [2025-03-08 01:59:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-03-08 01:59:41,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:41,686 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:59:41,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 01:59:41,686 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:41,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1940129791, now seen corresponding path program 1 times [2025-03-08 01:59:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:41,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469766477] [2025-03-08 01:59:41,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:41,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:41,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-03-08 01:59:41,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-03-08 01:59:41,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:41,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 922 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-03-08 01:59:42,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:42,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469766477] [2025-03-08 01:59:42,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469766477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:42,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:42,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:59:42,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872502199] [2025-03-08 01:59:42,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:42,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:59:42,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:42,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:59:42,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:59:42,014 INFO L87 Difference]: Start difference. First operand 25537 states and 26676 transitions. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:43,064 INFO L93 Difference]: Finished difference Result 52563 states and 54907 transitions. [2025-03-08 01:59:43,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:59:43,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 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 789 [2025-03-08 01:59:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:43,089 INFO L225 Difference]: With dead ends: 52563 [2025-03-08 01:59:43,089 INFO L226 Difference]: Without dead ends: 27327 [2025-03-08 01:59:43,104 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-08 01:59:43,105 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 630 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:43,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 421 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 01:59:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27327 states. [2025-03-08 01:59:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27327 to 26429. [2025-03-08 01:59:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26429 states, 26428 states have (on average 1.035908884516422) internal successors, (27377), 26428 states have internal predecessors, (27377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26429 states to 26429 states and 27377 transitions. [2025-03-08 01:59:43,310 INFO L78 Accepts]: Start accepts. Automaton has 26429 states and 27377 transitions. Word has length 789 [2025-03-08 01:59:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:43,310 INFO L471 AbstractCegarLoop]: Abstraction has 26429 states and 27377 transitions. [2025-03-08 01:59:43,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 26429 states and 27377 transitions. [2025-03-08 01:59:43,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-08 01:59:43,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:43,327 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:59:43,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 01:59:43,327 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:43,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:43,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2018179392, now seen corresponding path program 1 times [2025-03-08 01:59:43,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:43,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539278947] [2025-03-08 01:59:43,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:43,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:43,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-08 01:59:43,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-08 01:59:43,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:43,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2025-03-08 01:59:44,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:44,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539278947] [2025-03-08 01:59:44,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539278947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:44,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:44,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:59:44,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751121856] [2025-03-08 01:59:44,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:44,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:44,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:44,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:44,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:44,198 INFO L87 Difference]: Start difference. First operand 26429 states and 27377 transitions. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:44,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:44,951 INFO L93 Difference]: Finished difference Result 52255 states and 54138 transitions. [2025-03-08 01:59:44,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:44,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 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 829 [2025-03-08 01:59:44,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:44,975 INFO L225 Difference]: With dead ends: 52255 [2025-03-08 01:59:44,975 INFO L226 Difference]: Without dead ends: 26127 [2025-03-08 01:59:44,989 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-08 01:59:44,990 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 221 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:44,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 111 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:59:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26127 states. [2025-03-08 01:59:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26127 to 26127. [2025-03-08 01:59:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26127 states, 26126 states have (on average 1.0326494679629488) internal successors, (26979), 26126 states have internal predecessors, (26979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26127 states to 26127 states and 26979 transitions. [2025-03-08 01:59:45,235 INFO L78 Accepts]: Start accepts. Automaton has 26127 states and 26979 transitions. Word has length 829 [2025-03-08 01:59:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:45,236 INFO L471 AbstractCegarLoop]: Abstraction has 26127 states and 26979 transitions. [2025-03-08 01:59:45,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 26127 states and 26979 transitions. [2025-03-08 01:59:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 925 [2025-03-08 01:59:45,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:45,249 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:59:45,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 01:59:45,249 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:45,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:45,250 INFO L85 PathProgramCache]: Analyzing trace with hash 295165552, now seen corresponding path program 1 times [2025-03-08 01:59:45,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:45,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908624320] [2025-03-08 01:59:45,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:45,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:45,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 924 statements into 1 equivalence classes. [2025-03-08 01:59:45,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 924 of 924 statements. [2025-03-08 01:59:45,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:45,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 633 proven. 306 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2025-03-08 01:59:46,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:46,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908624320] [2025-03-08 01:59:46,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908624320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:59:46,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931804920] [2025-03-08 01:59:46,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:46,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:59:46,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:59:46,321 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-08 01:59:46,322 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-08 01:59:46,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 924 statements into 1 equivalence classes. [2025-03-08 01:59:46,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 924 of 924 statements. [2025-03-08 01:59:46,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:46,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:46,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:59:46,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:59:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 735 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2025-03-08 01:59:46,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:59:46,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931804920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:46,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:59:46,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 01:59:46,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030367849] [2025-03-08 01:59:46,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:46,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:46,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:46,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:46,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:59:46,832 INFO L87 Difference]: Start difference. First operand 26127 states and 26979 transitions. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:47,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:47,510 INFO L93 Difference]: Finished difference Result 51346 states and 53031 transitions. [2025-03-08 01:59:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:47,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 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 924 [2025-03-08 01:59:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:47,538 INFO L225 Difference]: With dead ends: 51346 [2025-03-08 01:59:47,538 INFO L226 Difference]: Without dead ends: 25520 [2025-03-08 01:59:47,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 928 GetRequests, 925 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-08 01:59:47,554 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 56 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:47,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 499 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:59:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25520 states. [2025-03-08 01:59:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25520 to 24320. [2025-03-08 01:59:47,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24320 states, 24319 states have (on average 1.0236851844237016) internal successors, (24895), 24319 states have internal predecessors, (24895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24320 states to 24320 states and 24895 transitions. [2025-03-08 01:59:47,773 INFO L78 Accepts]: Start accepts. Automaton has 24320 states and 24895 transitions. Word has length 924 [2025-03-08 01:59:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:47,773 INFO L471 AbstractCegarLoop]: Abstraction has 24320 states and 24895 transitions. [2025-03-08 01:59:47,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 24320 states and 24895 transitions. [2025-03-08 01:59:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 925 [2025-03-08 01:59:47,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:47,786 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:59:47,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 01:59:47,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:59:47,987 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:47,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:47,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2032166418, now seen corresponding path program 1 times [2025-03-08 01:59:47,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:47,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224761248] [2025-03-08 01:59:47,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:47,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:48,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 924 statements into 1 equivalence classes. [2025-03-08 01:59:48,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 924 of 924 statements. [2025-03-08 01:59:48,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:48,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 1023 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2025-03-08 01:59:48,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:48,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224761248] [2025-03-08 01:59:48,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224761248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:48,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:48,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:59:48,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522508987] [2025-03-08 01:59:48,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:48,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:59:48,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:48,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:59:48,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:59:48,628 INFO L87 Difference]: Start difference. First operand 24320 states and 24895 transitions. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:49,436 INFO L93 Difference]: Finished difference Result 53141 states and 54422 transitions. [2025-03-08 01:59:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:59:49,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 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 924 [2025-03-08 01:59:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:49,465 INFO L225 Difference]: With dead ends: 53141 [2025-03-08 01:59:49,465 INFO L226 Difference]: Without dead ends: 29122 [2025-03-08 01:59:49,480 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-08 01:59:49,480 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 346 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:49,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 119 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:59:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29122 states. [2025-03-08 01:59:49,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29122 to 24916. [2025-03-08 01:59:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24916 states, 24915 states have (on average 1.0221151916516156) internal successors, (25466), 24915 states have internal predecessors, (25466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24916 states to 24916 states and 25466 transitions. [2025-03-08 01:59:49,727 INFO L78 Accepts]: Start accepts. Automaton has 24916 states and 25466 transitions. Word has length 924 [2025-03-08 01:59:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:49,727 INFO L471 AbstractCegarLoop]: Abstraction has 24916 states and 25466 transitions. [2025-03-08 01:59:49,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 24916 states and 25466 transitions. [2025-03-08 01:59:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2025-03-08 01:59:49,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:49,740 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:59:49,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 01:59:49,740 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:49,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:49,741 INFO L85 PathProgramCache]: Analyzing trace with hash -945630627, now seen corresponding path program 1 times [2025-03-08 01:59:49,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:49,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591956716] [2025-03-08 01:59:49,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:49,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 927 statements into 1 equivalence classes. [2025-03-08 01:59:49,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 927 of 927 statements. [2025-03-08 01:59:49,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:49,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2025-03-08 01:59:50,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:50,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591956716] [2025-03-08 01:59:50,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591956716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:50,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:50,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:59:50,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590959890] [2025-03-08 01:59:50,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:50,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:59:50,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:50,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:59:50,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:59:50,148 INFO L87 Difference]: Start difference. First operand 24916 states and 25466 transitions. Second operand has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:51,103 INFO L93 Difference]: Finished difference Result 54021 states and 55229 transitions. [2025-03-08 01:59:51,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:59:51,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 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 927 [2025-03-08 01:59:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:51,132 INFO L225 Difference]: With dead ends: 54021 [2025-03-08 01:59:51,133 INFO L226 Difference]: Without dead ends: 29406 [2025-03-08 01:59:51,148 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-08 01:59:51,148 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 384 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:51,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 157 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:59:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29406 states. [2025-03-08 01:59:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29406 to 24615. [2025-03-08 01:59:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24615 states, 24614 states have (on average 1.0220199886243602) internal successors, (25156), 24614 states have internal predecessors, (25156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24615 states to 24615 states and 25156 transitions. [2025-03-08 01:59:51,384 INFO L78 Accepts]: Start accepts. Automaton has 24615 states and 25156 transitions. Word has length 927 [2025-03-08 01:59:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:51,384 INFO L471 AbstractCegarLoop]: Abstraction has 24615 states and 25156 transitions. [2025-03-08 01:59:51,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 24615 states and 25156 transitions. [2025-03-08 01:59:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2025-03-08 01:59:51,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:51,406 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:59:51,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 01:59:51,406 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:51,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:51,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1157818702, now seen corresponding path program 1 times [2025-03-08 01:59:51,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:51,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850850985] [2025-03-08 01:59:51,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:51,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:51,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 963 statements into 1 equivalence classes. [2025-03-08 01:59:51,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 963 of 963 statements. [2025-03-08 01:59:51,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:51,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 776 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-03-08 01:59:52,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:52,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850850985] [2025-03-08 01:59:52,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850850985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:52,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:52,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:59:52,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170264591] [2025-03-08 01:59:52,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:52,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:59:52,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:52,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:59:52,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:59:52,316 INFO L87 Difference]: Start difference. First operand 24615 states and 25156 transitions. Second operand has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:53,394 INFO L93 Difference]: Finished difference Result 58523 states and 59808 transitions. [2025-03-08 01:59:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:59:53,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 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 963 [2025-03-08 01:59:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:53,422 INFO L225 Difference]: With dead ends: 58523 [2025-03-08 01:59:53,422 INFO L226 Difference]: Without dead ends: 34209 [2025-03-08 01:59:53,434 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-08 01:59:53,434 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 403 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:53,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 146 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 01:59:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34209 states. [2025-03-08 01:59:53,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34209 to 24914. [2025-03-08 01:59:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24914 states, 24913 states have (on average 1.0219162686147794) internal successors, (25459), 24913 states have internal predecessors, (25459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24914 states to 24914 states and 25459 transitions. [2025-03-08 01:59:53,629 INFO L78 Accepts]: Start accepts. Automaton has 24914 states and 25459 transitions. Word has length 963 [2025-03-08 01:59:53,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:53,629 INFO L471 AbstractCegarLoop]: Abstraction has 24914 states and 25459 transitions. [2025-03-08 01:59:53,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:53,629 INFO L276 IsEmpty]: Start isEmpty. Operand 24914 states and 25459 transitions. [2025-03-08 01:59:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2025-03-08 01:59:53,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:53,642 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:59:53,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 01:59:53,643 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:53,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1932606974, now seen corresponding path program 1 times [2025-03-08 01:59:53,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:53,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195438065] [2025-03-08 01:59:53,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:53,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:53,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1011 statements into 1 equivalence classes. [2025-03-08 01:59:53,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1011 of 1011 statements. [2025-03-08 01:59:53,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:53,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2284 backedges. 1595 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-03-08 01:59:54,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:54,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195438065] [2025-03-08 01:59:54,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195438065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:59:54,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:59:54,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:59:54,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470428670] [2025-03-08 01:59:54,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:59:54,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:59:54,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:59:54,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:59:54,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:59:54,153 INFO L87 Difference]: Start difference. First operand 24914 states and 25459 transitions. Second operand has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:59:55,142 INFO L93 Difference]: Finished difference Result 55213 states and 56406 transitions. [2025-03-08 01:59:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:59:55,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 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 1011 [2025-03-08 01:59:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:59:55,165 INFO L225 Difference]: With dead ends: 55213 [2025-03-08 01:59:55,166 INFO L226 Difference]: Without dead ends: 27602 [2025-03-08 01:59:55,180 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-08 01:59:55,181 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 491 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:59:55,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 130 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 01:59:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27602 states. [2025-03-08 01:59:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27602 to 21315. [2025-03-08 01:59:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21315 states, 21314 states have (on average 1.0205498733226988) internal successors, (21752), 21314 states have internal predecessors, (21752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21315 states to 21315 states and 21752 transitions. [2025-03-08 01:59:55,361 INFO L78 Accepts]: Start accepts. Automaton has 21315 states and 21752 transitions. Word has length 1011 [2025-03-08 01:59:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:59:55,362 INFO L471 AbstractCegarLoop]: Abstraction has 21315 states and 21752 transitions. [2025-03-08 01:59:55,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:59:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 21315 states and 21752 transitions. [2025-03-08 01:59:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1060 [2025-03-08 01:59:55,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:59:55,379 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 01:59:55,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 01:59:55,379 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:59:55,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:59:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash -927698899, now seen corresponding path program 1 times [2025-03-08 01:59:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:59:55,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467919363] [2025-03-08 01:59:55,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:55,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:59:55,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1059 statements into 1 equivalence classes. [2025-03-08 01:59:55,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1059 of 1059 statements. [2025-03-08 01:59:55,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:55,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1603 backedges. 115 proven. 757 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2025-03-08 01:59:56,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:59:56,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467919363] [2025-03-08 01:59:56,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467919363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:59:56,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850759976] [2025-03-08 01:59:56,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:59:56,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:59:56,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:59:56,037 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-08 01:59:56,039 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-08 01:59:56,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1059 statements into 1 equivalence classes. [2025-03-08 01:59:56,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1059 of 1059 statements. [2025-03-08 01:59:56,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:59:56,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:59:56,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 01:59:56,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:59:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1603 backedges. 115 proven. 757 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2025-03-08 01:59:59,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:00:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1603 backedges. 115 proven. 757 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2025-03-08 02:00:00,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850759976] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:00:00,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:00:00,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-08 02:00:00,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138322025] [2025-03-08 02:00:00,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:00:00,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 02:00:00,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:00:00,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 02:00:00,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-08 02:00:00,857 INFO L87 Difference]: Start difference. First operand 21315 states and 21752 transitions. Second operand has 10 states, 10 states have (on average 144.1) internal successors, (1441), 9 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:00:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:00:03,519 INFO L93 Difference]: Finished difference Result 37803 states and 38631 transitions. [2025-03-08 02:00:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 02:00:03,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 144.1) internal successors, (1441), 9 states have internal predecessors, (1441), 0 states have call successors, (0), 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 1059 [2025-03-08 02:00:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:00:03,552 INFO L225 Difference]: With dead ends: 37803 [2025-03-08 02:00:03,552 INFO L226 Difference]: Without dead ends: 37801 [2025-03-08 02:00:03,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2120 GetRequests, 2112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-08 02:00:03,557 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 1047 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 3538 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 3856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 3538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:00:03,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 203 Invalid, 3856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 3538 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 02:00:03,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37801 states. [2025-03-08 02:00:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37801 to 21016. [2025-03-08 02:00:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21016 states, 21015 states have (on average 1.0205567451820128) internal successors, (21447), 21015 states have internal predecessors, (21447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:00:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21016 states to 21016 states and 21447 transitions. [2025-03-08 02:00:03,759 INFO L78 Accepts]: Start accepts. Automaton has 21016 states and 21447 transitions. Word has length 1059 [2025-03-08 02:00:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:00:03,759 INFO L471 AbstractCegarLoop]: Abstraction has 21016 states and 21447 transitions. [2025-03-08 02:00:03,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 144.1) internal successors, (1441), 9 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:00:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 21016 states and 21447 transitions. [2025-03-08 02:00:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1270 [2025-03-08 02:00:03,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:00:03,775 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:00:03,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 02:00:03,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 02:00:03,976 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:00:03,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:00:03,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1847457283, now seen corresponding path program 1 times [2025-03-08 02:00:03,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:00:03,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844695789] [2025-03-08 02:00:03,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:00:03,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:00:04,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1269 statements into 1 equivalence classes. [2025-03-08 02:00:04,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1269 of 1269 statements. [2025-03-08 02:00:04,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:00:04,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:00:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 1597 proven. 188 refuted. 0 times theorem prover too weak. 1701 trivial. 0 not checked. [2025-03-08 02:00:05,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:00:05,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844695789] [2025-03-08 02:00:05,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844695789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:00:05,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461655290] [2025-03-08 02:00:05,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:00:05,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:00:05,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:00:05,284 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-08 02:00:05,287 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-08 02:00:05,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1269 statements into 1 equivalence classes. [2025-03-08 02:00:05,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1269 of 1269 statements. [2025-03-08 02:00:05,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:00:05,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:00:05,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 1493 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:00:05,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:00:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 2340 proven. 0 refuted. 0 times theorem prover too weak. 1146 trivial. 0 not checked. [2025-03-08 02:00:05,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:00:05,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461655290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:00:05,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:00:05,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 02:00:05,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113865363] [2025-03-08 02:00:05,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:00:05,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:00:05,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:00:05,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:00:05,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:00:05,739 INFO L87 Difference]: Start difference. First operand 21016 states and 21447 transitions. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:00:06,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:00:06,314 INFO L93 Difference]: Finished difference Result 36311 states and 37068 transitions. [2025-03-08 02:00:06,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:00:06,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 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 1269 [2025-03-08 02:00:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:00:06,315 INFO L225 Difference]: With dead ends: 36311 [2025-03-08 02:00:06,315 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 02:00:06,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1272 GetRequests, 1268 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:00:06,327 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 230 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:00:06,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 357 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:00:06,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 02:00:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 02:00:06,328 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-08 02:00:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 02:00:06,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1269 [2025-03-08 02:00:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:00:06,328 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 02:00:06,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:00:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 02:00:06,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 02:00:06,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 02:00:06,340 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-08 02:00:06,532 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,SelfDestructingSolverStorable27 [2025-03-08 02:00:06,534 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-08 02:00:06,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 02:00:14,252 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 02:00:14,266 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-08 02:00:14,266 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-08 02:00:14,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:00:14 BoogieIcfgContainer [2025-03-08 02:00:14,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 02:00:14,274 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 02:00:14,277 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 02:00:14,277 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 02:00:14,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:59:08" (3/4) ... [2025-03-08 02:00:14,279 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 02:00:14,304 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 02:00:14,306 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 02:00:14,307 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 02:00:14,308 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 02:00:14,437 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 02:00:14,437 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 02:00:14,437 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 02:00:14,438 INFO L158 Benchmark]: Toolchain (without parser) took 69616.22ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 119.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 366.2MB. Max. memory is 16.1GB. [2025-03-08 02:00:14,438 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:00:14,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.23ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 45.6MB in the end (delta: 73.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-08 02:00:14,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 167.55ms. Allocated memory is still 167.8MB. Free memory was 45.6MB in the beginning and 87.1MB in the end (delta: -41.5MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2025-03-08 02:00:14,438 INFO L158 Benchmark]: Boogie Preprocessor took 222.91ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 96.5MB in the end (delta: -9.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2025-03-08 02:00:14,438 INFO L158 Benchmark]: IcfgBuilder took 2212.74ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 96.5MB in the beginning and 133.5MB in the end (delta: -37.0MB). Peak memory consumption was 221.9MB. Max. memory is 16.1GB. [2025-03-08 02:00:14,438 INFO L158 Benchmark]: TraceAbstraction took 66212.99ms. Allocated memory was 411.0MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 133.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 921.0MB. Max. memory is 16.1GB. [2025-03-08 02:00:14,438 INFO L158 Benchmark]: Witness Printer took 162.89ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 02:00:14,439 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.22ms. Allocated memory is still 201.3MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 627.23ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 45.6MB in the end (delta: 73.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 167.55ms. Allocated memory is still 167.8MB. Free memory was 45.6MB in the beginning and 87.1MB in the end (delta: -41.5MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 222.91ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 96.5MB in the end (delta: -9.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * IcfgBuilder took 2212.74ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 96.5MB in the beginning and 133.5MB in the end (delta: -37.0MB). Peak memory consumption was 221.9MB. Max. memory is 16.1GB. * TraceAbstraction took 66212.99ms. Allocated memory was 411.0MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 133.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 921.0MB. Max. memory is 16.1GB. * Witness Printer took 162.89ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 25.1MB). 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 * 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: 110]: 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, 749 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.4s, OverallIterations: 28, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 33.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11581 SdHoareTripleChecker+Valid, 29.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11581 mSDsluCounter, 9486 SdHoareTripleChecker+Invalid, 24.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1244 mSDsCounter, 4782 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33515 IncrementalHoareTripleChecker+Invalid, 38297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4782 mSolverCounterUnsat, 8242 mSDtfsCounter, 33515 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6240 GetRequests, 6180 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26429occurred in iteration=20, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 58187 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 21854 NumberOfCodeBlocks, 21854 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 23464 ConstructedInterpolants, 297 QuantifiedInterpolants, 77882 SizeOfPredicates, 6 NumberOfNonLiveVariables, 5283 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 35 InterpolantComputations, 26 PerfectInterpolantSequences, 30006/33078 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: ((((((((((((((((((((((((((((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 4)) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 60)))) || (((((0 <= ((long long) a29 + 14)) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0))) || ((((0 <= ((long long) 143 + a0)) && (((long long) 42 + a4) <= 0)) && (((long long) 98 + a0) <= 0)) && (3 == a2))) || (((((long long) 104 + a0) <= 0) && (2 == a2)) && (44 <= a29))) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (5 <= a2))) || (((2 != a2) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || (((140780 <= a0) && (a2 == 4)) && (((long long) a4 + 172330) <= 0))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (a29 <= 43))) || (((((long long) 89 + a4) <= 0) && (((long long) a0 + 61) <= 0)) && (((long long) a29 + 144) <= 0))) || (((((0 <= ((long long) a0 + 459337)) && (((long long) 104 + a0) <= 0)) && (((long long) 42 + a4) <= 0)) && (a2 == 4)) && (((long long) a29 + 144) <= 0))) || ((((((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 600263 + a0))) && (a29 <= 43))) || (((((((long long) 104 + a0) <= 0) && (0 <= ((long long) a29 + 14))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 600263 + a0))) && (a2 == 4))) || (((0 <= ((long long) a29 + 14)) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (3 == a2)) && (a29 <= 43))) || (((((long long) 42 + a4) <= 0) && (a2 == 4)) && (((long long) 366639 + a0) <= 0))) || (((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (a2 == 1))) || (((((0 <= ((long long) a29 + 14)) && (((long long) 42 + a4) <= 0)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (5 <= a2))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) 146 + a0))) && (((long long) a0 + 61) <= 0))) || ((((long long) 89 + a4) <= 0) && (3 == a2))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (0 <= ((long long) 44 + a0))) && (((long long) a29 + 127) == 0))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 600263 + a0))) && (5 <= a2))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (3 == a2))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) a4 + 85)))) RESULT: Ultimate proved your program to be correct! [2025-03-08 02:00:14,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE