./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label26.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 cdf2fa99034a2ce4515fc13e5b104f83251835a7a436038ebabc8d1f47f1da91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:50:47,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:50:47,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:50:47,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:50:47,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:50:47,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:50:47,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:50:47,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:50:47,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:50:47,566 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:50:47,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:50:47,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:50:47,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:50:47,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:50:47,566 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:50:47,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:50:47,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:50:47,567 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:50:47,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:50:47,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:50:47,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:50:47,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:50:47,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:50:47,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:50:47,567 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:50:47,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:50:47,567 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:50:47,568 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:50:47,568 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:50:47,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:50:47,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:50:47,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:50:47,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:50:47,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:50:47,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:50:47,568 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:50:47,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:50:47,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:50:47,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:50:47,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:50:47,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:50:47,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:50:47,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:50:47,569 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 -> cdf2fa99034a2ce4515fc13e5b104f83251835a7a436038ebabc8d1f47f1da91 [2025-03-03 10:50:47,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:50:47,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:50:47,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:50:47,767 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:50:47,768 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:50:47,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label26.c [2025-03-03 10:50:48,879 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082111f62/630090abb8534c91baa674817e049123/FLAGbac47a9e5 [2025-03-03 10:50:49,272 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:50:49,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label26.c [2025-03-03 10:50:49,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082111f62/630090abb8534c91baa674817e049123/FLAGbac47a9e5 [2025-03-03 10:50:49,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082111f62/630090abb8534c91baa674817e049123 [2025-03-03 10:50:49,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:50:49,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:50:49,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:50:49,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:50:49,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:50:49,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:50:49" (1/1) ... [2025-03-03 10:50:49,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397e8066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:49, skipping insertion in model container [2025-03-03 10:50:49,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:50:49" (1/1) ... [2025-03-03 10:50:49,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:50:49,663 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_label26.c[6541,6554] [2025-03-03 10:50:49,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:50:49,907 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:50:49,925 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_label26.c[6541,6554] [2025-03-03 10:50:50,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:50:50,072 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:50:50,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50 WrapperNode [2025-03-03 10:50:50,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:50:50,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:50:50,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:50:50,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:50:50,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50" (1/1) ... [2025-03-03 10:50:50,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50" (1/1) ... [2025-03-03 10:50:50,220 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-03 10:50:50,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:50:50,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:50:50,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:50:50,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:50:50,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50" (1/1) ... [2025-03-03 10:50:50,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50" (1/1) ... [2025-03-03 10:50:50,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50" (1/1) ... [2025-03-03 10:50:50,340 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:50:50,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50" (1/1) ... [2025-03-03 10:50:50,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50" (1/1) ... [2025-03-03 10:50:50,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50" (1/1) ... [2025-03-03 10:50:50,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50" (1/1) ... [2025-03-03 10:50:50,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50" (1/1) ... [2025-03-03 10:50:50,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50" (1/1) ... [2025-03-03 10:50:50,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:50:50,448 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:50:50,448 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:50:50,448 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:50:50,449 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50" (1/1) ... [2025-03-03 10:50:50,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:50:50,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:50:50,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:50:50,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:50:50,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:50:50,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:50:50,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:50:50,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:50:50,534 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:50:50,536 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:50:52,436 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-03 10:50:52,541 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-03 10:50:52,541 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:50:52,560 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:50:52,560 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:50:52,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:50:52 BoogieIcfgContainer [2025-03-03 10:50:52,561 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:50:52,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:50:52,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:50:52,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:50:52,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:50:49" (1/3) ... [2025-03-03 10:50:52,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a001d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:50:52, skipping insertion in model container [2025-03-03 10:50:52,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50" (2/3) ... [2025-03-03 10:50:52,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a001d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:50:52, skipping insertion in model container [2025-03-03 10:50:52,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:50:52" (3/3) ... [2025-03-03 10:50:52,570 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label26.c [2025-03-03 10:50:52,582 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:50:52,583 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label26.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:50:52,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:50:52,647 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;@75af3000, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:50:52,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:50:52,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 10:50:52,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:52,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:52,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:52,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1397927119, now seen corresponding path program 1 times [2025-03-03 10:50:52,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:52,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867842298] [2025-03-03 10:50:52,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:52,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:52,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 10:50:52,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 10:50:52,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:52,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:50:52,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:52,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867842298] [2025-03-03 10:50:52,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867842298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:52,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:52,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:50:52,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397121422] [2025-03-03 10:50:52,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:52,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:52,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:52,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:52,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:52,956 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:54,432 INFO L93 Difference]: Finished difference Result 1191 states and 2154 transitions. [2025-03-03 10:50:54,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:54,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-03 10:50:54,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:54,443 INFO L225 Difference]: With dead ends: 1191 [2025-03-03 10:50:54,443 INFO L226 Difference]: Without dead ends: 688 [2025-03-03 10:50:54,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:54,447 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 318 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:54,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 229 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:50:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-03 10:50:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680. [2025-03-03 10:50:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.609720176730486) internal successors, (1093), 679 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1093 transitions. [2025-03-03 10:50:54,494 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1093 transitions. Word has length 53 [2025-03-03 10:50:54,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:54,494 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1093 transitions. [2025-03-03 10:50:54,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1093 transitions. [2025-03-03 10:50:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 10:50:54,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:54,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:50:54,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:50:54,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:54,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:54,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1455318446, now seen corresponding path program 1 times [2025-03-03 10:50:54,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:54,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306097724] [2025-03-03 10:50:54,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:54,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:54,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 10:50:54,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 10:50:54,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:54,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:50:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306097724] [2025-03-03 10:50:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306097724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:54,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:54,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:50:54,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621652184] [2025-03-03 10:50:54,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:54,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:54,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:54,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:54,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:54,733 INFO L87 Difference]: Start difference. First operand 680 states and 1093 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:55,868 INFO L93 Difference]: Finished difference Result 1964 states and 3171 transitions. [2025-03-03 10:50:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:55,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-03-03 10:50:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:55,874 INFO L225 Difference]: With dead ends: 1964 [2025-03-03 10:50:55,874 INFO L226 Difference]: Without dead ends: 1286 [2025-03-03 10:50:55,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:55,878 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:55,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 361 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:50:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-03-03 10:50:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1281. [2025-03-03 10:50:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.3953125) internal successors, (1786), 1280 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1786 transitions. [2025-03-03 10:50:55,912 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1786 transitions. Word has length 121 [2025-03-03 10:50:55,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:55,912 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1786 transitions. [2025-03-03 10:50:55,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1786 transitions. [2025-03-03 10:50:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 10:50:55,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:55,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:55,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:50:55,915 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:55,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:55,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1108927334, now seen corresponding path program 1 times [2025-03-03 10:50:55,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:55,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785322814] [2025-03-03 10:50:55,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:55,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:55,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 10:50:55,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 10:50:55,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:55,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:50:56,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:56,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785322814] [2025-03-03 10:50:56,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785322814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:56,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:56,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:50:56,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334795796] [2025-03-03 10:50:56,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:56,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:56,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:56,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:56,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:56,242 INFO L87 Difference]: Start difference. First operand 1281 states and 1786 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:57,680 INFO L93 Difference]: Finished difference Result 2859 states and 3905 transitions. [2025-03-03 10:50:57,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:57,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-03-03 10:50:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:57,688 INFO L225 Difference]: With dead ends: 2859 [2025-03-03 10:50:57,689 INFO L226 Difference]: Without dead ends: 1580 [2025-03-03 10:50:57,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:57,696 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 225 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:57,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 359 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:50:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-03-03 10:50:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2025-03-03 10:50:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1579 states have (on average 1.3242558581380621) internal successors, (2091), 1579 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2091 transitions. [2025-03-03 10:50:57,719 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2091 transitions. Word has length 129 [2025-03-03 10:50:57,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:57,720 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2091 transitions. [2025-03-03 10:50:57,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:57,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2091 transitions. [2025-03-03 10:50:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 10:50:57,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:57,725 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:50:57,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:50:57,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:57,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:57,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2045632556, now seen corresponding path program 1 times [2025-03-03 10:50:57,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:57,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824946206] [2025-03-03 10:50:57,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:57,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:57,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 10:50:57,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 10:50:57,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:57,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:50:57,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:57,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824946206] [2025-03-03 10:50:57,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824946206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:57,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:57,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:57,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847810247] [2025-03-03 10:50:57,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:57,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:57,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:57,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:57,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:57,979 INFO L87 Difference]: Start difference. First operand 1580 states and 2091 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:59,144 INFO L93 Difference]: Finished difference Result 4065 states and 5551 transitions. [2025-03-03 10:50:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:59,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 220 [2025-03-03 10:50:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:59,154 INFO L225 Difference]: With dead ends: 4065 [2025-03-03 10:50:59,154 INFO L226 Difference]: Without dead ends: 2786 [2025-03-03 10:50:59,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:59,157 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 275 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:59,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 636 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:50:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2025-03-03 10:50:59,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2786. [2025-03-03 10:50:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2786 states, 2785 states have (on average 1.2204667863554757) internal successors, (3399), 2785 states have internal predecessors, (3399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 3399 transitions. [2025-03-03 10:50:59,217 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 3399 transitions. Word has length 220 [2025-03-03 10:50:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:59,218 INFO L471 AbstractCegarLoop]: Abstraction has 2786 states and 3399 transitions. [2025-03-03 10:50:59,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 3399 transitions. [2025-03-03 10:50:59,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 10:50:59,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:59,221 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:59,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:50:59,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:59,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1707990554, now seen corresponding path program 1 times [2025-03-03 10:50:59,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:59,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811244007] [2025-03-03 10:50:59,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:59,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:59,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 10:50:59,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 10:50:59,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:59,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-03 10:50:59,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:59,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811244007] [2025-03-03 10:50:59,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811244007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:59,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:59,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:50:59,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460684885] [2025-03-03 10:50:59,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:59,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:59,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:59,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:59,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:59,430 INFO L87 Difference]: Start difference. First operand 2786 states and 3399 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:00,601 INFO L93 Difference]: Finished difference Result 6472 states and 8164 transitions. [2025-03-03 10:51:00,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:00,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2025-03-03 10:51:00,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:00,612 INFO L225 Difference]: With dead ends: 6472 [2025-03-03 10:51:00,612 INFO L226 Difference]: Without dead ends: 3987 [2025-03-03 10:51:00,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:00,614 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 220 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:00,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 363 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:51:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3987 states. [2025-03-03 10:51:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3987 to 3686. [2025-03-03 10:51:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 3685 states have (on average 1.1959294436906378) internal successors, (4407), 3685 states have internal predecessors, (4407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4407 transitions. [2025-03-03 10:51:00,657 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4407 transitions. Word has length 226 [2025-03-03 10:51:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:00,657 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4407 transitions. [2025-03-03 10:51:00,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4407 transitions. [2025-03-03 10:51:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-03 10:51:00,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:00,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:51:00,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:51:00,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:00,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2026317815, now seen corresponding path program 1 times [2025-03-03 10:51:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:00,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836643667] [2025-03-03 10:51:00,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:00,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-03 10:51:00,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-03 10:51:00,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:00,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 10:51:00,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:00,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836643667] [2025-03-03 10:51:00,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836643667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:00,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:00,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:51:00,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719822335] [2025-03-03 10:51:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:00,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:00,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:00,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:00,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:00,899 INFO L87 Difference]: Start difference. First operand 3686 states and 4407 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:02,117 INFO L93 Difference]: Finished difference Result 9471 states and 11465 transitions. [2025-03-03 10:51:02,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:02,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 335 [2025-03-03 10:51:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:02,131 INFO L225 Difference]: With dead ends: 9471 [2025-03-03 10:51:02,131 INFO L226 Difference]: Without dead ends: 6086 [2025-03-03 10:51:02,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:02,135 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 31 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:02,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 325 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:51:02,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6086 states. [2025-03-03 10:51:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6086 to 5485. [2025-03-03 10:51:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5485 states, 5484 states have (on average 1.1692195477753464) internal successors, (6412), 5484 states have internal predecessors, (6412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5485 states to 5485 states and 6412 transitions. [2025-03-03 10:51:02,219 INFO L78 Accepts]: Start accepts. Automaton has 5485 states and 6412 transitions. Word has length 335 [2025-03-03 10:51:02,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:02,220 INFO L471 AbstractCegarLoop]: Abstraction has 5485 states and 6412 transitions. [2025-03-03 10:51:02,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 5485 states and 6412 transitions. [2025-03-03 10:51:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-03 10:51:02,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:02,222 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:02,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:51:02,223 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:02,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:02,223 INFO L85 PathProgramCache]: Analyzing trace with hash -179911007, now seen corresponding path program 1 times [2025-03-03 10:51:02,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:02,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201626182] [2025-03-03 10:51:02,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:02,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:02,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-03 10:51:02,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-03 10:51:02,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:02,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 10:51:02,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:02,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201626182] [2025-03-03 10:51:02,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201626182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:02,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:02,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:02,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097580980] [2025-03-03 10:51:02,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:02,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:02,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:02,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:02,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:02,436 INFO L87 Difference]: Start difference. First operand 5485 states and 6412 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:03,698 INFO L93 Difference]: Finished difference Result 12470 states and 14901 transitions. [2025-03-03 10:51:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:03,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 340 [2025-03-03 10:51:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:03,713 INFO L225 Difference]: With dead ends: 12470 [2025-03-03 10:51:03,714 INFO L226 Difference]: Without dead ends: 7286 [2025-03-03 10:51:03,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:03,719 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 274 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:03,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 639 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:51:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2025-03-03 10:51:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 7284. [2025-03-03 10:51:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7284 states, 7283 states have (on average 1.148427845667994) internal successors, (8364), 7283 states have internal predecessors, (8364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 8364 transitions. [2025-03-03 10:51:03,801 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 8364 transitions. Word has length 340 [2025-03-03 10:51:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:03,801 INFO L471 AbstractCegarLoop]: Abstraction has 7284 states and 8364 transitions. [2025-03-03 10:51:03,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 8364 transitions. [2025-03-03 10:51:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-03-03 10:51:03,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:03,806 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:03,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:51:03,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:03,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:03,807 INFO L85 PathProgramCache]: Analyzing trace with hash 530031907, now seen corresponding path program 1 times [2025-03-03 10:51:03,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:03,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254958527] [2025-03-03 10:51:03,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:03,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:03,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-03 10:51:03,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-03 10:51:03,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:03,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:51:04,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:04,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254958527] [2025-03-03 10:51:04,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254958527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:04,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:04,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:04,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677284032] [2025-03-03 10:51:04,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:04,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:04,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:04,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:04,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:04,165 INFO L87 Difference]: Start difference. First operand 7284 states and 8364 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:05,536 INFO L93 Difference]: Finished difference Result 16069 states and 18808 transitions. [2025-03-03 10:51:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:05,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 416 [2025-03-03 10:51:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:05,555 INFO L225 Difference]: With dead ends: 16069 [2025-03-03 10:51:05,555 INFO L226 Difference]: Without dead ends: 9086 [2025-03-03 10:51:05,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:05,560 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 248 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:05,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 622 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:51:05,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2025-03-03 10:51:05,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 8780. [2025-03-03 10:51:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8780 states, 8779 states have (on average 1.1346394805786537) internal successors, (9961), 8779 states have internal predecessors, (9961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8780 states to 8780 states and 9961 transitions. [2025-03-03 10:51:05,648 INFO L78 Accepts]: Start accepts. Automaton has 8780 states and 9961 transitions. Word has length 416 [2025-03-03 10:51:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:05,648 INFO L471 AbstractCegarLoop]: Abstraction has 8780 states and 9961 transitions. [2025-03-03 10:51:05,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 8780 states and 9961 transitions. [2025-03-03 10:51:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-03 10:51:05,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:05,657 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:05,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:51:05,657 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:05,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:05,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1057394097, now seen corresponding path program 1 times [2025-03-03 10:51:05,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:05,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052407991] [2025-03-03 10:51:05,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:05,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:05,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-03 10:51:05,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-03 10:51:05,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:05,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 10:51:05,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:05,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052407991] [2025-03-03 10:51:05,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052407991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:05,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:05,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:05,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043624687] [2025-03-03 10:51:05,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:05,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:05,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:05,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:05,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:05,906 INFO L87 Difference]: Start difference. First operand 8780 states and 9961 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:07,093 INFO L93 Difference]: Finished difference Result 20548 states and 23478 transitions. [2025-03-03 10:51:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:07,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 426 [2025-03-03 10:51:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:07,112 INFO L225 Difference]: With dead ends: 20548 [2025-03-03 10:51:07,113 INFO L226 Difference]: Without dead ends: 12069 [2025-03-03 10:51:07,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:07,124 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 261 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:07,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 316 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:51:07,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12069 states. [2025-03-03 10:51:07,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12069 to 7877. [2025-03-03 10:51:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7877 states, 7876 states have (on average 1.1444895886236668) internal successors, (9014), 7876 states have internal predecessors, (9014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:07,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7877 states to 7877 states and 9014 transitions. [2025-03-03 10:51:07,229 INFO L78 Accepts]: Start accepts. Automaton has 7877 states and 9014 transitions. Word has length 426 [2025-03-03 10:51:07,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:07,229 INFO L471 AbstractCegarLoop]: Abstraction has 7877 states and 9014 transitions. [2025-03-03 10:51:07,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 7877 states and 9014 transitions. [2025-03-03 10:51:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-03 10:51:07,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:07,233 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:07,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:51:07,233 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:07,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:07,237 INFO L85 PathProgramCache]: Analyzing trace with hash 697051817, now seen corresponding path program 1 times [2025-03-03 10:51:07,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:07,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150255115] [2025-03-03 10:51:07,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:07,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:07,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-03 10:51:07,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-03 10:51:07,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:07,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-03-03 10:51:07,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:07,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150255115] [2025-03-03 10:51:07,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150255115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:07,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:07,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:07,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279967098] [2025-03-03 10:51:07,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:07,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:07,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:07,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:07,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:07,417 INFO L87 Difference]: Start difference. First operand 7877 states and 9014 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:08,430 INFO L93 Difference]: Finished difference Result 17844 states and 20678 transitions. [2025-03-03 10:51:08,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:08,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 517 [2025-03-03 10:51:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:08,447 INFO L225 Difference]: With dead ends: 17844 [2025-03-03 10:51:08,447 INFO L226 Difference]: Without dead ends: 10268 [2025-03-03 10:51:08,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:08,454 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 362 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 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, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:08,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 446 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:51:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10268 states. [2025-03-03 10:51:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10268 to 10268. [2025-03-03 10:51:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10268 states, 10267 states have (on average 1.146878348105581) internal successors, (11775), 10267 states have internal predecessors, (11775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 11775 transitions. [2025-03-03 10:51:08,545 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 11775 transitions. Word has length 517 [2025-03-03 10:51:08,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:08,545 INFO L471 AbstractCegarLoop]: Abstraction has 10268 states and 11775 transitions. [2025-03-03 10:51:08,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:08,546 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 11775 transitions. [2025-03-03 10:51:08,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-03 10:51:08,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:08,549 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:08,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:51:08,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:08,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:08,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1594619597, now seen corresponding path program 1 times [2025-03-03 10:51:08,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:08,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684128287] [2025-03-03 10:51:08,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:08,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:08,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-03 10:51:08,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-03 10:51:08,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:08,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-03 10:51:08,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:08,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684128287] [2025-03-03 10:51:08,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684128287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:08,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:08,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:08,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4996096] [2025-03-03 10:51:08,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:08,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:08,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:08,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:08,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:08,870 INFO L87 Difference]: Start difference. First operand 10268 states and 11775 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:09,948 INFO L93 Difference]: Finished difference Result 25033 states and 28938 transitions. [2025-03-03 10:51:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:09,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 541 [2025-03-03 10:51:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:09,967 INFO L225 Difference]: With dead ends: 25033 [2025-03-03 10:51:09,967 INFO L226 Difference]: Without dead ends: 15066 [2025-03-03 10:51:09,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:09,973 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 248 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:09,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:51:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15066 states. [2025-03-03 10:51:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15066 to 15055. [2025-03-03 10:51:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15055 states, 15054 states have (on average 1.1306629467251228) internal successors, (17021), 15054 states have internal predecessors, (17021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15055 states to 15055 states and 17021 transitions. [2025-03-03 10:51:10,115 INFO L78 Accepts]: Start accepts. Automaton has 15055 states and 17021 transitions. Word has length 541 [2025-03-03 10:51:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:10,115 INFO L471 AbstractCegarLoop]: Abstraction has 15055 states and 17021 transitions. [2025-03-03 10:51:10,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 15055 states and 17021 transitions. [2025-03-03 10:51:10,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-03-03 10:51:10,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:10,122 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:10,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:51:10,123 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:10,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:10,123 INFO L85 PathProgramCache]: Analyzing trace with hash -934586077, now seen corresponding path program 1 times [2025-03-03 10:51:10,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:10,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683554126] [2025-03-03 10:51:10,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:10,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:10,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-03-03 10:51:10,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-03-03 10:51:10,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:10,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 153 proven. 317 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-03 10:51:10,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:10,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683554126] [2025-03-03 10:51:10,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683554126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:51:10,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435029250] [2025-03-03 10:51:10,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:10,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:10,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:51:10,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:51:10,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:51:11,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-03-03 10:51:11,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-03-03 10:51:11,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:11,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:11,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:51:11,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:51:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-03 10:51:11,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:51:11,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435029250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:11,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:51:11,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 10:51:11,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560336227] [2025-03-03 10:51:11,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:11,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:11,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:11,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:11,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:51:11,227 INFO L87 Difference]: Start difference. First operand 15055 states and 17021 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:12,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:12,714 INFO L93 Difference]: Finished difference Result 29506 states and 33400 transitions. [2025-03-03 10:51:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:12,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 595 [2025-03-03 10:51:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:12,731 INFO L225 Difference]: With dead ends: 29506 [2025-03-03 10:51:12,731 INFO L226 Difference]: Without dead ends: 14752 [2025-03-03 10:51:12,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:51:12,743 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 278 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:12,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 606 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:51:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14752 states. [2025-03-03 10:51:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14752 to 13854. [2025-03-03 10:51:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13854 states, 13853 states have (on average 1.081642965422652) internal successors, (14984), 13853 states have internal predecessors, (14984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13854 states to 13854 states and 14984 transitions. [2025-03-03 10:51:12,859 INFO L78 Accepts]: Start accepts. Automaton has 13854 states and 14984 transitions. Word has length 595 [2025-03-03 10:51:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:12,859 INFO L471 AbstractCegarLoop]: Abstraction has 13854 states and 14984 transitions. [2025-03-03 10:51:12,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 13854 states and 14984 transitions. [2025-03-03 10:51:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 10:51:12,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:12,866 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:12,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:51:13,067 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-03 10:51:13,067 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:13,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:13,068 INFO L85 PathProgramCache]: Analyzing trace with hash -542838215, now seen corresponding path program 1 times [2025-03-03 10:51:13,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:13,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38441182] [2025-03-03 10:51:13,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:13,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:13,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 10:51:13,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 10:51:13,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:13,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-03 10:51:13,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:13,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38441182] [2025-03-03 10:51:13,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38441182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:51:13,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871559708] [2025-03-03 10:51:13,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:13,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:13,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:51:13,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:51:13,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:51:13,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 10:51:13,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 10:51:13,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:13,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:13,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:51:13,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:51:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-03 10:51:14,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:51:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-03 10:51:14,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871559708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:51:14,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:51:14,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-03 10:51:14,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588413956] [2025-03-03 10:51:14,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:51:14,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:51:14,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:14,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:51:14,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:51:14,863 INFO L87 Difference]: Start difference. First operand 13854 states and 14984 transitions. Second operand has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:18,722 INFO L93 Difference]: Finished difference Result 36040 states and 38971 transitions. [2025-03-03 10:51:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 10:51:18,722 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 608 [2025-03-03 10:51:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:18,737 INFO L225 Difference]: With dead ends: 36040 [2025-03-03 10:51:18,737 INFO L226 Difference]: Without dead ends: 16546 [2025-03-03 10:51:18,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1225 GetRequests, 1211 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-03 10:51:18,749 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 3519 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4669 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3519 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 5440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 4669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:18,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3519 Valid, 192 Invalid, 5440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 4669 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-03 10:51:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16546 states. [2025-03-03 10:51:18,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16546 to 12656. [2025-03-03 10:51:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12656 states, 12655 states have (on average 1.0378506519162387) internal successors, (13134), 12655 states have internal predecessors, (13134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12656 states to 12656 states and 13134 transitions. [2025-03-03 10:51:18,871 INFO L78 Accepts]: Start accepts. Automaton has 12656 states and 13134 transitions. Word has length 608 [2025-03-03 10:51:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:18,871 INFO L471 AbstractCegarLoop]: Abstraction has 12656 states and 13134 transitions. [2025-03-03 10:51:18,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 12656 states and 13134 transitions. [2025-03-03 10:51:18,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2025-03-03 10:51:18,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:18,884 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:18,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:51:19,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 10:51:19,084 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:19,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:19,085 INFO L85 PathProgramCache]: Analyzing trace with hash -362622361, now seen corresponding path program 1 times [2025-03-03 10:51:19,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:19,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377370119] [2025-03-03 10:51:19,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:19,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:19,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 678 statements into 1 equivalence classes. [2025-03-03 10:51:19,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 678 of 678 statements. [2025-03-03 10:51:19,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:19,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2025-03-03 10:51:19,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:19,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377370119] [2025-03-03 10:51:19,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377370119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:19,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:19,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:19,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647462924] [2025-03-03 10:51:19,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:19,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:19,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:19,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:19,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:19,305 INFO L87 Difference]: Start difference. First operand 12656 states and 13134 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:20,067 INFO L93 Difference]: Finished difference Result 27997 states and 29099 transitions. [2025-03-03 10:51:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:20,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 678 [2025-03-03 10:51:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:20,082 INFO L225 Difference]: With dead ends: 27997 [2025-03-03 10:51:20,082 INFO L226 Difference]: Without dead ends: 15343 [2025-03-03 10:51:20,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:20,091 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 277 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:20,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 192 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:51:20,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15343 states. [2025-03-03 10:51:20,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15343 to 14744. [2025-03-03 10:51:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14744 states, 14743 states have (on average 1.033643084853829) internal successors, (15239), 14743 states have internal predecessors, (15239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14744 states to 14744 states and 15239 transitions. [2025-03-03 10:51:20,245 INFO L78 Accepts]: Start accepts. Automaton has 14744 states and 15239 transitions. Word has length 678 [2025-03-03 10:51:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:20,245 INFO L471 AbstractCegarLoop]: Abstraction has 14744 states and 15239 transitions. [2025-03-03 10:51:20,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 14744 states and 15239 transitions. [2025-03-03 10:51:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-03-03 10:51:20,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:20,254 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:20,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:51:20,254 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:20,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:20,255 INFO L85 PathProgramCache]: Analyzing trace with hash -736605304, now seen corresponding path program 1 times [2025-03-03 10:51:20,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:20,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892624790] [2025-03-03 10:51:20,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:20,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-03 10:51:20,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-03 10:51:20,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:20,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 596 proven. 190 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 10:51:20,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:20,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892624790] [2025-03-03 10:51:20,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892624790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:51:20,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047779027] [2025-03-03 10:51:20,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:20,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:20,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:51:20,881 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:51:20,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:51:20,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-03 10:51:21,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-03 10:51:21,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:21,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:21,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:51:21,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:51:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-03-03 10:51:21,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:51:21,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047779027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:21,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:51:21,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:51:21,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714340587] [2025-03-03 10:51:21,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:21,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:21,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:21,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:21,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:51:21,327 INFO L87 Difference]: Start difference. First operand 14744 states and 15239 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:22,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:22,208 INFO L93 Difference]: Finished difference Result 31296 states and 32405 transitions. [2025-03-03 10:51:22,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:22,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 685 [2025-03-03 10:51:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:22,224 INFO L225 Difference]: With dead ends: 31296 [2025-03-03 10:51:22,224 INFO L226 Difference]: Without dead ends: 16554 [2025-03-03 10:51:22,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:51:22,235 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 298 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:22,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 126 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:51:22,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16554 states. [2025-03-03 10:51:22,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16554 to 14444. [2025-03-03 10:51:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14444 states, 14443 states have (on average 1.0335802811050336) internal successors, (14928), 14443 states have internal predecessors, (14928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14444 states to 14444 states and 14928 transitions. [2025-03-03 10:51:22,399 INFO L78 Accepts]: Start accepts. Automaton has 14444 states and 14928 transitions. Word has length 685 [2025-03-03 10:51:22,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:22,400 INFO L471 AbstractCegarLoop]: Abstraction has 14444 states and 14928 transitions. [2025-03-03 10:51:22,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 14444 states and 14928 transitions. [2025-03-03 10:51:22,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2025-03-03 10:51:22,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:22,408 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:22,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:51:22,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:22,609 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:22,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:22,609 INFO L85 PathProgramCache]: Analyzing trace with hash -299701220, now seen corresponding path program 1 times [2025-03-03 10:51:22,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:22,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147394488] [2025-03-03 10:51:22,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:22,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:22,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-03-03 10:51:22,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-03-03 10:51:22,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:22,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-03-03 10:51:23,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:23,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147394488] [2025-03-03 10:51:23,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147394488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:23,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:23,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:51:23,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268450454] [2025-03-03 10:51:23,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:23,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:51:23,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:23,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:51:23,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:51:23,031 INFO L87 Difference]: Start difference. First operand 14444 states and 14928 transitions. Second operand has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:24,255 INFO L93 Difference]: Finished difference Result 31888 states and 33032 transitions. [2025-03-03 10:51:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:51:24,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 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 711 [2025-03-03 10:51:24,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:24,272 INFO L225 Difference]: With dead ends: 31888 [2025-03-03 10:51:24,272 INFO L226 Difference]: Without dead ends: 17745 [2025-03-03 10:51:24,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:51:24,283 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 656 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:24,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 450 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:51:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17745 states. [2025-03-03 10:51:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17745 to 16848. [2025-03-03 10:51:24,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16848 states, 16847 states have (on average 1.0306285985635424) internal successors, (17363), 16847 states have internal predecessors, (17363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16848 states to 16848 states and 17363 transitions. [2025-03-03 10:51:24,403 INFO L78 Accepts]: Start accepts. Automaton has 16848 states and 17363 transitions. Word has length 711 [2025-03-03 10:51:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:24,403 INFO L471 AbstractCegarLoop]: Abstraction has 16848 states and 17363 transitions. [2025-03-03 10:51:24,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 16848 states and 17363 transitions. [2025-03-03 10:51:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2025-03-03 10:51:24,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:24,412 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:51:24,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:51:24,413 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:24,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:24,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1013736812, now seen corresponding path program 1 times [2025-03-03 10:51:24,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:24,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559287579] [2025-03-03 10:51:24,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:24,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:24,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 796 statements into 1 equivalence classes. [2025-03-03 10:51:24,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 796 of 796 statements. [2025-03-03 10:51:24,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:24,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-03-03 10:51:24,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:24,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559287579] [2025-03-03 10:51:24,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559287579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:24,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:24,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:24,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814398454] [2025-03-03 10:51:24,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:24,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:24,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:24,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:24,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:24,693 INFO L87 Difference]: Start difference. First operand 16848 states and 17363 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:25,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:25,329 INFO L93 Difference]: Finished difference Result 33692 states and 34726 transitions. [2025-03-03 10:51:25,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:25,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 796 [2025-03-03 10:51:25,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:25,344 INFO L225 Difference]: With dead ends: 33692 [2025-03-03 10:51:25,344 INFO L226 Difference]: Without dead ends: 17145 [2025-03-03 10:51:25,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:25,355 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 436 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:25,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 68 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:51:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17145 states. [2025-03-03 10:51:25,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17145 to 16846. [2025-03-03 10:51:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16846 states, 16845 states have (on average 1.0305135054912438) internal successors, (17359), 16845 states have internal predecessors, (17359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16846 states to 16846 states and 17359 transitions. [2025-03-03 10:51:25,470 INFO L78 Accepts]: Start accepts. Automaton has 16846 states and 17359 transitions. Word has length 796 [2025-03-03 10:51:25,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:25,470 INFO L471 AbstractCegarLoop]: Abstraction has 16846 states and 17359 transitions. [2025-03-03 10:51:25,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 16846 states and 17359 transitions. [2025-03-03 10:51:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-03-03 10:51:25,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:25,480 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:25,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:51:25,481 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:25,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:25,481 INFO L85 PathProgramCache]: Analyzing trace with hash 319922832, now seen corresponding path program 1 times [2025-03-03 10:51:25,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:25,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244449756] [2025-03-03 10:51:25,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:25,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:25,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-03-03 10:51:25,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-03-03 10:51:25,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:25,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 802 proven. 51 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-03 10:51:26,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:26,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244449756] [2025-03-03 10:51:26,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244449756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:51:26,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050567363] [2025-03-03 10:51:26,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:26,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:26,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:51:26,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:51:26,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:51:26,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-03-03 10:51:26,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-03-03 10:51:26,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:26,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:26,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:51:26,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:51:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2025-03-03 10:51:27,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:51:27,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050567363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:27,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:51:27,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:51:27,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970389516] [2025-03-03 10:51:27,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:27,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:51:27,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:27,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:51:27,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:51:27,453 INFO L87 Difference]: Start difference. First operand 16846 states and 17359 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:28,802 INFO L93 Difference]: Finished difference Result 39687 states and 40957 transitions. [2025-03-03 10:51:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:51:28,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 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 838 [2025-03-03 10:51:28,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:28,825 INFO L225 Difference]: With dead ends: 39687 [2025-03-03 10:51:28,825 INFO L226 Difference]: Without dead ends: 23142 [2025-03-03 10:51:28,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:51:28,837 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 311 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:28,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 117 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:51:28,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23142 states. [2025-03-03 10:51:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23142 to 19541. [2025-03-03 10:51:29,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19541 states, 19540 states have (on average 1.028300921187308) internal successors, (20093), 19540 states have internal predecessors, (20093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19541 states to 19541 states and 20093 transitions. [2025-03-03 10:51:29,019 INFO L78 Accepts]: Start accepts. Automaton has 19541 states and 20093 transitions. Word has length 838 [2025-03-03 10:51:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:29,019 INFO L471 AbstractCegarLoop]: Abstraction has 19541 states and 20093 transitions. [2025-03-03 10:51:29,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 19541 states and 20093 transitions. [2025-03-03 10:51:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2025-03-03 10:51:29,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:29,035 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:29,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:51:29,235 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,SelfDestructingSolverStorable17 [2025-03-03 10:51:29,235 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:29,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash -286311481, now seen corresponding path program 1 times [2025-03-03 10:51:29,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:29,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579160487] [2025-03-03 10:51:29,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:29,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:29,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 920 statements into 1 equivalence classes. [2025-03-03 10:51:29,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 920 of 920 statements. [2025-03-03 10:51:29,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:29,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2025-03-03 10:51:29,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:29,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579160487] [2025-03-03 10:51:29,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579160487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:29,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:29,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:51:29,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938611981] [2025-03-03 10:51:29,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:29,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:51:29,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:29,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:51:29,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:51:29,693 INFO L87 Difference]: Start difference. First operand 19541 states and 20093 transitions. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:30,719 INFO L93 Difference]: Finished difference Result 41176 states and 42431 transitions. [2025-03-03 10:51:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:51:30,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 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 920 [2025-03-03 10:51:30,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:30,743 INFO L225 Difference]: With dead ends: 41176 [2025-03-03 10:51:30,743 INFO L226 Difference]: Without dead ends: 24332 [2025-03-03 10:51:30,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:51:30,755 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 514 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:30,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 137 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:51:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24332 states. [2025-03-03 10:51:30,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24332 to 23131. [2025-03-03 10:51:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23131 states, 23130 states have (on average 1.028880242109814) internal successors, (23798), 23130 states have internal predecessors, (23798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23131 states to 23131 states and 23798 transitions. [2025-03-03 10:51:30,938 INFO L78 Accepts]: Start accepts. Automaton has 23131 states and 23798 transitions. Word has length 920 [2025-03-03 10:51:30,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:30,939 INFO L471 AbstractCegarLoop]: Abstraction has 23131 states and 23798 transitions. [2025-03-03 10:51:30,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 23131 states and 23798 transitions. [2025-03-03 10:51:30,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 926 [2025-03-03 10:51:30,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:30,952 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:30,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:51:30,952 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:30,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:30,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2067912909, now seen corresponding path program 1 times [2025-03-03 10:51:30,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:30,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155567150] [2025-03-03 10:51:30,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:30,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:31,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 925 statements into 1 equivalence classes. [2025-03-03 10:51:31,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 925 of 925 statements. [2025-03-03 10:51:31,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:31,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 742 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2025-03-03 10:51:31,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:31,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155567150] [2025-03-03 10:51:31,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155567150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:31,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:31,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:31,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895970926] [2025-03-03 10:51:31,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:31,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:31,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:31,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:31,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:31,304 INFO L87 Difference]: Start difference. First operand 23131 states and 23798 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:32,048 INFO L93 Difference]: Finished difference Result 46851 states and 48300 transitions. [2025-03-03 10:51:32,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:32,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 925 [2025-03-03 10:51:32,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:32,070 INFO L225 Difference]: With dead ends: 46851 [2025-03-03 10:51:32,070 INFO L226 Difference]: Without dead ends: 26417 [2025-03-03 10:51:32,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:32,085 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 312 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:32,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 507 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:51:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26417 states. [2025-03-03 10:51:32,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26417 to 22229. [2025-03-03 10:51:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22229 states, 22228 states have (on average 1.0279377361885909) internal successors, (22849), 22228 states have internal predecessors, (22849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:32,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22229 states to 22229 states and 22849 transitions. [2025-03-03 10:51:32,268 INFO L78 Accepts]: Start accepts. Automaton has 22229 states and 22849 transitions. Word has length 925 [2025-03-03 10:51:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:32,269 INFO L471 AbstractCegarLoop]: Abstraction has 22229 states and 22849 transitions. [2025-03-03 10:51:32,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:32,269 INFO L276 IsEmpty]: Start isEmpty. Operand 22229 states and 22849 transitions. [2025-03-03 10:51:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2025-03-03 10:51:32,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:32,321 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:32,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:51:32,321 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:32,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:32,322 INFO L85 PathProgramCache]: Analyzing trace with hash 477878608, now seen corresponding path program 1 times [2025-03-03 10:51:32,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:32,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310613466] [2025-03-03 10:51:32,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:32,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:32,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1077 statements into 1 equivalence classes. [2025-03-03 10:51:32,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1077 of 1077 statements. [2025-03-03 10:51:32,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:32,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 1370 proven. 51 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2025-03-03 10:51:33,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:33,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310613466] [2025-03-03 10:51:33,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310613466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:51:33,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742072764] [2025-03-03 10:51:33,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:33,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:33,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:51:33,380 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:51:33,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:51:33,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1077 statements into 1 equivalence classes. [2025-03-03 10:51:33,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1077 of 1077 statements. [2025-03-03 10:51:33,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:33,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:33,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 1259 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:51:33,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:51:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 1520 proven. 266 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2025-03-03 10:51:35,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:51:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 955 proven. 0 refuted. 0 times theorem prover too weak. 1295 trivial. 0 not checked. [2025-03-03 10:51:35,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742072764] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:51:35,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:51:35,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 8 [2025-03-03 10:51:35,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971788709] [2025-03-03 10:51:35,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:35,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:35,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:35,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:35,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:51:35,234 INFO L87 Difference]: Start difference. First operand 22229 states and 22849 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:35,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:35,812 INFO L93 Difference]: Finished difference Result 35433 states and 36424 transitions. [2025-03-03 10:51:35,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:35,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1077 [2025-03-03 10:51:35,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:35,825 INFO L225 Difference]: With dead ends: 35433 [2025-03-03 10:51:35,825 INFO L226 Difference]: Without dead ends: 15602 [2025-03-03 10:51:35,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2157 GetRequests, 2151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:51:35,835 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 193 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:35,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 359 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:51:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15602 states. [2025-03-03 10:51:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15602 to 14107. [2025-03-03 10:51:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14107 states, 14106 states have (on average 1.0194952502481214) internal successors, (14381), 14106 states have internal predecessors, (14381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14107 states to 14107 states and 14381 transitions. [2025-03-03 10:51:35,936 INFO L78 Accepts]: Start accepts. Automaton has 14107 states and 14381 transitions. Word has length 1077 [2025-03-03 10:51:35,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:35,936 INFO L471 AbstractCegarLoop]: Abstraction has 14107 states and 14381 transitions. [2025-03-03 10:51:35,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 14107 states and 14381 transitions. [2025-03-03 10:51:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1090 [2025-03-03 10:51:35,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:35,949 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:35,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:51:36,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:36,149 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:36,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:36,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1829367132, now seen corresponding path program 1 times [2025-03-03 10:51:36,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:36,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750496389] [2025-03-03 10:51:36,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:36,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:36,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1089 statements into 1 equivalence classes. [2025-03-03 10:51:36,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1089 of 1089 statements. [2025-03-03 10:51:36,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:36,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1988 backedges. 1272 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2025-03-03 10:51:36,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:37,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750496389] [2025-03-03 10:51:37,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750496389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:37,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:37,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:51:37,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296405864] [2025-03-03 10:51:37,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:37,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:51:37,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:37,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:51:37,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:51:37,001 INFO L87 Difference]: Start difference. First operand 14107 states and 14381 transitions. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:37,952 INFO L93 Difference]: Finished difference Result 22806 states and 23250 transitions. [2025-03-03 10:51:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:51:37,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1089 [2025-03-03 10:51:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:37,974 INFO L225 Difference]: With dead ends: 22806 [2025-03-03 10:51:37,974 INFO L226 Difference]: Without dead ends: 22804 [2025-03-03 10:51:37,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:51:37,982 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 369 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:37,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 80 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:51:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22804 states. [2025-03-03 10:51:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22804 to 15307. [2025-03-03 10:51:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15307 states, 15306 states have (on average 1.0195348229452503) internal successors, (15605), 15306 states have internal predecessors, (15605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15307 states to 15307 states and 15605 transitions. [2025-03-03 10:51:38,116 INFO L78 Accepts]: Start accepts. Automaton has 15307 states and 15605 transitions. Word has length 1089 [2025-03-03 10:51:38,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:38,116 INFO L471 AbstractCegarLoop]: Abstraction has 15307 states and 15605 transitions. [2025-03-03 10:51:38,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 15307 states and 15605 transitions. [2025-03-03 10:51:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1186 [2025-03-03 10:51:38,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:38,130 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:38,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:51:38,130 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:38,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:38,131 INFO L85 PathProgramCache]: Analyzing trace with hash -875116457, now seen corresponding path program 1 times [2025-03-03 10:51:38,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:38,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407094073] [2025-03-03 10:51:38,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:38,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:38,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1185 statements into 1 equivalence classes. [2025-03-03 10:51:38,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1185 of 1185 statements. [2025-03-03 10:51:38,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:38,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:38,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2221 backedges. 254 proven. 1108 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2025-03-03 10:51:38,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:38,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407094073] [2025-03-03 10:51:38,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407094073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:51:38,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129262814] [2025-03-03 10:51:38,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:38,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:38,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:51:38,916 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:51:38,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:51:39,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1185 statements into 1 equivalence classes. [2025-03-03 10:51:39,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1185 of 1185 statements. [2025-03-03 10:51:39,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:39,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:39,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:51:39,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:51:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2221 backedges. 1439 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2025-03-03 10:51:39,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:51:39,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129262814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:39,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:51:39,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:51:39,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367073016] [2025-03-03 10:51:39,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:39,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:39,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:39,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:39,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:51:39,462 INFO L87 Difference]: Start difference. First operand 15307 states and 15605 transitions. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:40,074 INFO L93 Difference]: Finished difference Result 32105 states and 32742 transitions. [2025-03-03 10:51:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:40,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1185 [2025-03-03 10:51:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:40,091 INFO L225 Difference]: With dead ends: 32105 [2025-03-03 10:51:40,092 INFO L226 Difference]: Without dead ends: 19497 [2025-03-03 10:51:40,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1188 GetRequests, 1184 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:51:40,100 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 197 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:40,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 369 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:51:40,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19497 states. [2025-03-03 10:51:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19497 to 15900. [2025-03-03 10:51:40,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15900 states, 15899 states have (on average 1.0184917290395623) internal successors, (16193), 15899 states have internal predecessors, (16193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15900 states to 15900 states and 16193 transitions. [2025-03-03 10:51:40,251 INFO L78 Accepts]: Start accepts. Automaton has 15900 states and 16193 transitions. Word has length 1185 [2025-03-03 10:51:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:40,252 INFO L471 AbstractCegarLoop]: Abstraction has 15900 states and 16193 transitions. [2025-03-03 10:51:40,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 15900 states and 16193 transitions. [2025-03-03 10:51:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1214 [2025-03-03 10:51:40,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:40,266 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:40,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 10:51:40,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:40,466 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:40,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:40,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1097214472, now seen corresponding path program 1 times [2025-03-03 10:51:40,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:40,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329722492] [2025-03-03 10:51:40,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:40,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:40,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1213 statements into 1 equivalence classes. [2025-03-03 10:51:40,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1213 of 1213 statements. [2025-03-03 10:51:40,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:40,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2333 backedges. 1135 proven. 0 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2025-03-03 10:51:41,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:41,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329722492] [2025-03-03 10:51:41,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329722492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:41,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:41,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:51:41,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91359716] [2025-03-03 10:51:41,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:41,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:51:41,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:41,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:51:41,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:51:41,366 INFO L87 Difference]: Start difference. First operand 15900 states and 16193 transitions. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:42,654 INFO L93 Difference]: Finished difference Result 30596 states and 31168 transitions. [2025-03-03 10:51:42,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:51:42,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1213 [2025-03-03 10:51:42,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:42,669 INFO L225 Difference]: With dead ends: 30596 [2025-03-03 10:51:42,670 INFO L226 Difference]: Without dead ends: 17395 [2025-03-03 10:51:42,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:51:42,678 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 428 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2502 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:42,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 555 Invalid, 2536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2502 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:51:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17395 states. [2025-03-03 10:51:42,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17395 to 14997. [2025-03-03 10:51:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14997 states, 14996 states have (on average 1.0173379567884768) internal successors, (15256), 14996 states have internal predecessors, (15256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14997 states to 14997 states and 15256 transitions. [2025-03-03 10:51:42,864 INFO L78 Accepts]: Start accepts. Automaton has 14997 states and 15256 transitions. Word has length 1213 [2025-03-03 10:51:42,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:42,865 INFO L471 AbstractCegarLoop]: Abstraction has 14997 states and 15256 transitions. [2025-03-03 10:51:42,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:42,865 INFO L276 IsEmpty]: Start isEmpty. Operand 14997 states and 15256 transitions. [2025-03-03 10:51:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1494 [2025-03-03 10:51:42,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:42,903 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:42,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 10:51:42,904 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:42,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:42,904 INFO L85 PathProgramCache]: Analyzing trace with hash 487453360, now seen corresponding path program 1 times [2025-03-03 10:51:42,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:42,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048597458] [2025-03-03 10:51:42,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:42,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:43,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1493 statements into 1 equivalence classes. [2025-03-03 10:51:43,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1493 of 1493 statements. [2025-03-03 10:51:43,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:43,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 2372 proven. 458 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2025-03-03 10:51:45,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:45,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048597458] [2025-03-03 10:51:45,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048597458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:51:45,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706403878] [2025-03-03 10:51:45,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:45,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:45,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:51:45,103 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:51:45,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 10:51:45,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1493 statements into 1 equivalence classes. [2025-03-03 10:51:45,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1493 of 1493 statements. [2025-03-03 10:51:45,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:45,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:45,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 1699 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:51:45,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:51:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 2481 proven. 0 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2025-03-03 10:51:45,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:51:45,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706403878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:45,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:51:45,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 10:51:45,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091076709] [2025-03-03 10:51:45,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:45,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:45,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:45,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:45,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:51:45,636 INFO L87 Difference]: Start difference. First operand 14997 states and 15256 transitions. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:46,265 INFO L93 Difference]: Finished difference Result 29395 states and 29905 transitions. [2025-03-03 10:51:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:46,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 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 1493 [2025-03-03 10:51:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:46,282 INFO L225 Difference]: With dead ends: 29395 [2025-03-03 10:51:46,283 INFO L226 Difference]: Without dead ends: 17095 [2025-03-03 10:51:46,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1498 GetRequests, 1493 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:51:46,292 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 195 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:46,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 426 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:51:46,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17095 states. [2025-03-03 10:51:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17095 to 16195. [2025-03-03 10:51:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16195 states, 16194 states have (on average 1.0167345930591578) internal successors, (16465), 16194 states have internal predecessors, (16465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16195 states to 16195 states and 16465 transitions. [2025-03-03 10:51:46,474 INFO L78 Accepts]: Start accepts. Automaton has 16195 states and 16465 transitions. Word has length 1493 [2025-03-03 10:51:46,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:46,475 INFO L471 AbstractCegarLoop]: Abstraction has 16195 states and 16465 transitions. [2025-03-03 10:51:46,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 16195 states and 16465 transitions. [2025-03-03 10:51:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2025-03-03 10:51:46,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:46,506 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-03 10:51:46,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 10:51:46,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:46,706 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:46,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:46,707 INFO L85 PathProgramCache]: Analyzing trace with hash -408481733, now seen corresponding path program 1 times [2025-03-03 10:51:46,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:46,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313959798] [2025-03-03 10:51:46,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:46,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:46,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1495 statements into 1 equivalence classes. [2025-03-03 10:51:46,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1495 of 1495 statements. [2025-03-03 10:51:46,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:46,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4156 backedges. 2622 proven. 460 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2025-03-03 10:51:48,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:48,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313959798] [2025-03-03 10:51:48,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313959798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:51:48,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181203083] [2025-03-03 10:51:48,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:48,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:48,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:51:48,866 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:51:48,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 10:51:48,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1495 statements into 1 equivalence classes. [2025-03-03 10:51:49,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1495 of 1495 statements. [2025-03-03 10:51:49,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:49,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:49,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 1723 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:51:49,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:51:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4156 backedges. 1571 proven. 0 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2025-03-03 10:51:51,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:51:51,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181203083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:51,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:51:51,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-03 10:51:51,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896080362] [2025-03-03 10:51:51,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:51,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:51:51,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:51,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:51:51,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:51:51,720 INFO L87 Difference]: Start difference. First operand 16195 states and 16465 transitions. Second operand has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:56,838 INFO L93 Difference]: Finished difference Result 23391 states and 23774 transitions. [2025-03-03 10:51:56,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:51:56,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 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 1495 [2025-03-03 10:51:56,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:56,840 INFO L225 Difference]: With dead ends: 23391 [2025-03-03 10:51:56,840 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:51:56,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1500 GetRequests, 1494 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:51:56,847 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 369 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 68 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:56,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 75 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1392 Invalid, 6 Unknown, 0 Unchecked, 5.0s Time] [2025-03-03 10:51:56,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:51:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:51:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:51:56,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1495 [2025-03-03 10:51:56,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:56,848 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:51:56,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:51:56,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:51:56,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:51:56,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 10:51:57,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 10:51:57,054 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] [2025-03-03 10:51:57,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:52:03,807 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:52:03,830 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:52:03,830 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:52:03,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:52:03 BoogieIcfgContainer [2025-03-03 10:52:03,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:52:03,841 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:52:03,841 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:52:03,841 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:52:03,845 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:50:52" (3/4) ... [2025-03-03 10:52:03,846 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:52:03,866 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-03 10:52:03,868 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:52:03,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:52:03,870 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:52:04,004 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:52:04,005 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:52:04,005 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:52:04,005 INFO L158 Benchmark]: Toolchain (without parser) took 74549.71ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 116.9MB in the beginning and 595.1MB in the end (delta: -478.1MB). Peak memory consumption was 826.3MB. Max. memory is 16.1GB. [2025-03-03 10:52:04,005 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:52:04,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 615.87ms. Allocated memory is still 167.8MB. Free memory was 116.5MB in the beginning and 43.4MB in the end (delta: 73.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-03 10:52:04,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 146.70ms. Allocated memory is still 167.8MB. Free memory was 43.4MB in the beginning and 85.0MB in the end (delta: -41.6MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2025-03-03 10:52:04,007 INFO L158 Benchmark]: Boogie Preprocessor took 225.35ms. Allocated memory is still 167.8MB. Free memory was 85.0MB in the beginning and 94.7MB in the end (delta: -9.7MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2025-03-03 10:52:04,007 INFO L158 Benchmark]: IcfgBuilder took 2113.22ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 94.7MB in the beginning and 213.6MB in the end (delta: -119.0MB). Peak memory consumption was 164.3MB. Max. memory is 16.1GB. [2025-03-03 10:52:04,008 INFO L158 Benchmark]: TraceAbstraction took 71278.18ms. Allocated memory was 285.2MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 213.6MB in the beginning and 620.1MB in the end (delta: -406.5MB). Peak memory consumption was 977.1MB. Max. memory is 16.1GB. [2025-03-03 10:52:04,008 INFO L158 Benchmark]: Witness Printer took 163.60ms. Allocated memory is still 1.5GB. Free memory was 620.1MB in the beginning and 595.1MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 10:52:04,011 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.19ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 615.87ms. Allocated memory is still 167.8MB. Free memory was 116.5MB in the beginning and 43.4MB in the end (delta: 73.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 146.70ms. Allocated memory is still 167.8MB. Free memory was 43.4MB in the beginning and 85.0MB in the end (delta: -41.6MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 225.35ms. Allocated memory is still 167.8MB. Free memory was 85.0MB in the beginning and 94.7MB in the end (delta: -9.7MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. * IcfgBuilder took 2113.22ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 94.7MB in the beginning and 213.6MB in the end (delta: -119.0MB). Peak memory consumption was 164.3MB. Max. memory is 16.1GB. * TraceAbstraction took 71278.18ms. Allocated memory was 285.2MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 213.6MB in the beginning and 620.1MB in the end (delta: -406.5MB). Peak memory consumption was 977.1MB. Max. memory is 16.1GB. * Witness Printer took 163.60ms. Allocated memory is still 1.5GB. Free memory was 620.1MB in the beginning and 595.1MB 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: 176]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.4s, OverallIterations: 26, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 35.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 11096 SdHoareTripleChecker+Valid, 32.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11096 mSDsluCounter, 9176 SdHoareTripleChecker+Invalid, 28.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1088 mSDsCounter, 4521 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30587 IncrementalHoareTripleChecker+Invalid, 35114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4521 mSolverCounterUnsat, 8088 mSDtfsCounter, 30587 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9754 GetRequests, 9681 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23131occurred in iteration=19, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 38996 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 25608 NumberOfCodeBlocks, 25608 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 27257 ConstructedInterpolants, 661 QuantifiedInterpolants, 87692 SizeOfPredicates, 6 NumberOfNonLiveVariables, 9304 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 36 InterpolantComputations, 25 PerfectInterpolantSequences, 43153/46171 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((0 <= ((long long) 97 + a0)) && (2 == a2)) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0)) || (((((0 <= ((long long) a0 + 459337)) && (((long long) 42 + a4) <= 0)) && (a2 == 1)) && (a29 <= 42)) && ((((long long) a0 + 300075) == 0) || (((long long) a0 + 300075) < 0)))) || (((((long long) 89 + a4) <= 0) && (a29 <= 42)) && (3 == a2))) || (((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (3 == a2))) || (((((long long) 89 + a4) <= 0) && (a29 <= 42)) && (a2 == 4))) || ((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (a2 == 1))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || ((((0 <= ((long long) a29 + 15)) && (((long long) 89 + a4) <= 0)) && (a29 <= 42)) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (5 <= a2)) && (((long long) a0 + 61) <= 0))) || (((((long long) 42 + a4) <= 0) && (a2 == 4)) && ((((long long) a0 + 300075) == 0) || (((long long) a0 + 300075) < 0)))) || ((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (a2 == 4)) && (((long long) a29 + 127) <= 0))) || (((((long long) 42 + a4) <= 0) && (5 <= a2)) && ((((long long) a0 + 300075) == 0) || (((long long) a0 + 300075) < 0)))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a29 + 15))) && ((((0 <= ((long long) a4 + 85)) && (a2 == 1)) && (a29 <= 42)) || (((a2 == 1) && (a29 <= 42)) && (((long long) a0 + 61) <= 0))))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (a29 <= 42))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 127) == 0)) && (((long long) 44 + a0) == 0))) || (((((((0 <= ((long long) a0 + 459337)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0)) && (a29 <= 42)) && (5 <= a2))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 61) <= 0))) || (((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a29 <= 42)) && (5 <= a2))) || (((((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (a2 == 1)) && (a29 <= 42)) && (((long long) a0 + 61) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((2 == a2) && (44 <= a29)) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 60)))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0))) || (((2 == a2) && (44 <= a29)) && (((long long) a0 + 386992) <= 0))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a29 + 15))) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:52:04,032 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