./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label28.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 b327f04e85816300a772fdcab90c62f95ac5a620d1563dfbe08b64473c277d33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:05:00,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:05:00,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:05:00,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:05:00,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:05:00,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:05:00,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:05:00,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:05:00,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:05:00,485 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:05:00,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:05:00,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:05:00,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:05:00,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:05:00,486 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:05:00,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:05:00,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:05:00,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:05:00,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:05:00,487 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:05:00,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:05:00,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:05:00,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:05:00,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:05:00,487 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:05:00,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:05:00,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:05:00,487 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:05:00,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:05:00,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:05:00,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:05:00,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:05:00,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:05:00,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:05:00,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:05:00,488 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:05:00,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:05:00,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:05:00,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:05:00,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:05:00,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:05:00,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:05:00,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:05:00,488 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 -> b327f04e85816300a772fdcab90c62f95ac5a620d1563dfbe08b64473c277d33 [2025-03-08 02:05:00,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:05:00,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:05:00,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:05:00,742 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:05:00,743 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:05:00,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label28.c [2025-03-08 02:05:01,879 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e7a5165/72668f0395d64d5790402a475f71ee62/FLAGc04932ec9 [2025-03-08 02:05:02,211 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:05:02,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label28.c [2025-03-08 02:05:02,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e7a5165/72668f0395d64d5790402a475f71ee62/FLAGc04932ec9 [2025-03-08 02:05:02,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e7a5165/72668f0395d64d5790402a475f71ee62 [2025-03-08 02:05:02,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:05:02,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:05:02,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:05:02,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:05:02,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:05:02,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:05:02" (1/1) ... [2025-03-08 02:05:02,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8d0687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02, skipping insertion in model container [2025-03-08 02:05:02,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:05:02" (1/1) ... [2025-03-08 02:05:02,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:05:02,646 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/Problem16_label28.c[6890,6903] [2025-03-08 02:05:02,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:05:02,871 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:05:02,890 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/Problem16_label28.c[6890,6903] [2025-03-08 02:05:02,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:05:02,996 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:05:02,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02 WrapperNode [2025-03-08 02:05:02,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:05:02,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:05:02,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:05:02,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:05:03,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02" (1/1) ... [2025-03-08 02:05:03,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02" (1/1) ... [2025-03-08 02:05:03,116 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-08 02:05:03,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:05:03,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:05:03,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:05:03,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:05:03,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02" (1/1) ... [2025-03-08 02:05:03,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02" (1/1) ... [2025-03-08 02:05:03,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02" (1/1) ... [2025-03-08 02:05:03,190 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:05:03,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02" (1/1) ... [2025-03-08 02:05:03,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02" (1/1) ... [2025-03-08 02:05:03,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02" (1/1) ... [2025-03-08 02:05:03,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02" (1/1) ... [2025-03-08 02:05:03,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02" (1/1) ... [2025-03-08 02:05:03,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02" (1/1) ... [2025-03-08 02:05:03,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:05:03,276 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:05:03,276 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:05:03,276 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:05:03,276 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02" (1/1) ... [2025-03-08 02:05:03,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:05:03,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:03,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:05:03,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:05:03,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:05:03,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:05:03,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:05:03,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:05:03,375 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:05:03,377 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:05:04,971 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-08 02:05:05,048 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-08 02:05:05,048 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:05:05,107 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:05:05,108 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:05:05,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:05 BoogieIcfgContainer [2025-03-08 02:05:05,108 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:05:05,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:05:05,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:05:05,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:05:05,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:05:02" (1/3) ... [2025-03-08 02:05:05,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b1f870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:05:05, skipping insertion in model container [2025-03-08 02:05:05,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:02" (2/3) ... [2025-03-08 02:05:05,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b1f870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:05:05, skipping insertion in model container [2025-03-08 02:05:05,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:05" (3/3) ... [2025-03-08 02:05:05,116 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label28.c [2025-03-08 02:05:05,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:05:05,130 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label28.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:05:05,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:05:05,201 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;@278e031d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:05:05,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:05:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:05,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 02:05:05,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:05,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:05,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:05,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash 981419012, now seen corresponding path program 1 times [2025-03-08 02:05:05,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:05,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612982159] [2025-03-08 02:05:05,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:05,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:05,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 02:05:05,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 02:05:05,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:05,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:05:05,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:05,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612982159] [2025-03-08 02:05:05,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612982159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:05,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:05,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:05:05,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410011673] [2025-03-08 02:05:05,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:05,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:05,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:05,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:05,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:05,573 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:06,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:06,813 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-03-08 02:05:06,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:06,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-08 02:05:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:06,831 INFO L225 Difference]: With dead ends: 1122 [2025-03-08 02:05:06,831 INFO L226 Difference]: Without dead ends: 662 [2025-03-08 02:05:06,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:06,839 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 321 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:06,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:05:06,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-08 02:05:06,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-08 02:05:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions. [2025-03-08 02:05:06,916 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 66 [2025-03-08 02:05:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:06,916 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions. [2025-03-08 02:05:06,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions. [2025-03-08 02:05:06,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 02:05:06,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:06,921 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:06,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:05:06,922 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:06,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:06,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1351708112, now seen corresponding path program 1 times [2025-03-08 02:05:06,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:06,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677483901] [2025-03-08 02:05:06,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:06,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:06,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 02:05:06,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 02:05:06,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:06,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:05:07,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:07,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677483901] [2025-03-08 02:05:07,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677483901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:07,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:07,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:05:07,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669143382] [2025-03-08 02:05:07,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:07,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:05:07,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:07,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:05:07,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:05:07,247 INFO L87 Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:08,783 INFO L93 Difference]: Finished difference Result 2309 states and 3414 transitions. [2025-03-08 02:05:08,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:05:08,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-08 02:05:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:08,789 INFO L225 Difference]: With dead ends: 2309 [2025-03-08 02:05:08,789 INFO L226 Difference]: Without dead ends: 1649 [2025-03-08 02:05:08,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:05:08,793 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1008 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:08,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 42 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:05:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-03-08 02:05:08,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-03-08 02:05:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.4016990291262137) internal successors, (2310), 1648 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2310 transitions. [2025-03-08 02:05:08,840 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2310 transitions. Word has length 134 [2025-03-08 02:05:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:08,840 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2310 transitions. [2025-03-08 02:05:08,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2310 transitions. [2025-03-08 02:05:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 02:05:08,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:08,850 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, 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] [2025-03-08 02:05:08,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:05:08,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:08,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:08,853 INFO L85 PathProgramCache]: Analyzing trace with hash 49658962, now seen corresponding path program 1 times [2025-03-08 02:05:08,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:08,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82744774] [2025-03-08 02:05:08,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:08,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 02:05:08,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 02:05:08,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:08,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:05:09,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:09,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82744774] [2025-03-08 02:05:09,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82744774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:09,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:09,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:05:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010127351] [2025-03-08 02:05:09,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:09,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:09,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:09,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:09,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:09,054 INFO L87 Difference]: Start difference. First operand 1649 states and 2310 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:10,155 INFO L93 Difference]: Finished difference Result 3625 states and 5242 transitions. [2025-03-08 02:05:10,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:10,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2025-03-08 02:05:10,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:10,166 INFO L225 Difference]: With dead ends: 3625 [2025-03-08 02:05:10,167 INFO L226 Difference]: Without dead ends: 2307 [2025-03-08 02:05:10,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:10,169 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:10,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:05:10,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-08 02:05:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-08 02:05:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.349956634865568) internal successors, (3113), 2306 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3113 transitions. [2025-03-08 02:05:10,205 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3113 transitions. Word has length 197 [2025-03-08 02:05:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:10,205 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3113 transitions. [2025-03-08 02:05:10,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3113 transitions. [2025-03-08 02:05:10,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-08 02:05:10,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:10,208 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:10,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:05:10,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:10,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1817376360, now seen corresponding path program 1 times [2025-03-08 02:05:10,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:10,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890477900] [2025-03-08 02:05:10,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:10,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 02:05:10,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 02:05:10,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:10,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 02:05:10,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:10,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890477900] [2025-03-08 02:05:10,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890477900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:10,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:10,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:05:10,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857386674] [2025-03-08 02:05:10,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:10,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:10,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:10,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:10,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:10,364 INFO L87 Difference]: Start difference. First operand 2307 states and 3113 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:11,222 INFO L93 Difference]: Finished difference Result 5599 states and 7699 transitions. [2025-03-08 02:05:11,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:11,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 232 [2025-03-08 02:05:11,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:11,232 INFO L225 Difference]: With dead ends: 5599 [2025-03-08 02:05:11,232 INFO L226 Difference]: Without dead ends: 3623 [2025-03-08 02:05:11,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:11,235 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:11,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:05:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-03-08 02:05:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 2965. [2025-03-08 02:05:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.2442645074224021) internal successors, (3688), 2964 states have internal predecessors, (3688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3688 transitions. [2025-03-08 02:05:11,283 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3688 transitions. Word has length 232 [2025-03-08 02:05:11,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:11,284 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 3688 transitions. [2025-03-08 02:05:11,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:11,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3688 transitions. [2025-03-08 02:05:11,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-08 02:05:11,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:11,289 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:11,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:05:11,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:11,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash 473299686, now seen corresponding path program 1 times [2025-03-08 02:05:11,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:11,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432330131] [2025-03-08 02:05:11,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:11,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:11,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-08 02:05:11,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-08 02:05:11,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:11,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:05:11,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:11,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432330131] [2025-03-08 02:05:11,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432330131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:11,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:11,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:05:11,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782668495] [2025-03-08 02:05:11,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:11,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:11,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:11,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:11,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:11,436 INFO L87 Difference]: Start difference. First operand 2965 states and 3688 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:12,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:12,279 INFO L93 Difference]: Finished difference Result 6915 states and 8657 transitions. [2025-03-08 02:05:12,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:12,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2025-03-08 02:05:12,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:12,287 INFO L225 Difference]: With dead ends: 6915 [2025-03-08 02:05:12,287 INFO L226 Difference]: Without dead ends: 3623 [2025-03-08 02:05:12,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:12,289 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 286 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:12,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 540 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:05:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-03-08 02:05:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3623. [2025-03-08 02:05:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 3622 states have (on average 1.0762009939260078) internal successors, (3898), 3622 states have internal predecessors, (3898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 3898 transitions. [2025-03-08 02:05:12,325 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 3898 transitions. Word has length 249 [2025-03-08 02:05:12,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:12,325 INFO L471 AbstractCegarLoop]: Abstraction has 3623 states and 3898 transitions. [2025-03-08 02:05:12,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 3898 transitions. [2025-03-08 02:05:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-08 02:05:12,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:12,328 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, 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] [2025-03-08 02:05:12,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:05:12,328 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:12,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:12,328 INFO L85 PathProgramCache]: Analyzing trace with hash 809957966, now seen corresponding path program 1 times [2025-03-08 02:05:12,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:12,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472467552] [2025-03-08 02:05:12,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:12,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:12,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-08 02:05:12,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-08 02:05:12,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:12,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:05:12,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:12,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472467552] [2025-03-08 02:05:12,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472467552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:12,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:12,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:05:12,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261824933] [2025-03-08 02:05:12,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:12,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:12,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:12,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:12,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:12,533 INFO L87 Difference]: Start difference. First operand 3623 states and 3898 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:13,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:13,227 INFO L93 Difference]: Finished difference Result 8231 states and 8905 transitions. [2025-03-08 02:05:13,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:13,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 301 [2025-03-08 02:05:13,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:13,237 INFO L225 Difference]: With dead ends: 8231 [2025-03-08 02:05:13,237 INFO L226 Difference]: Without dead ends: 4939 [2025-03-08 02:05:13,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:13,240 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 270 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:13,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 419 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:05:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2025-03-08 02:05:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939. [2025-03-08 02:05:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4938 states have (on average 1.0514378290805995) internal successors, (5192), 4938 states have internal predecessors, (5192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5192 transitions. [2025-03-08 02:05:13,294 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 5192 transitions. Word has length 301 [2025-03-08 02:05:13,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:13,295 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 5192 transitions. [2025-03-08 02:05:13,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:13,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 5192 transitions. [2025-03-08 02:05:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-08 02:05:13,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:13,299 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:13,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:05:13,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:13,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:13,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1946708000, now seen corresponding path program 1 times [2025-03-08 02:05:13,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:13,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850394813] [2025-03-08 02:05:13,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:13,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:13,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-08 02:05:13,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-08 02:05:13,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:13,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 02:05:13,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:13,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850394813] [2025-03-08 02:05:13,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850394813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:13,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278617940] [2025-03-08 02:05:13,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:13,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:13,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:13,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:05:13,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:05:13,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-08 02:05:13,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-08 02:05:13,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:13,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:13,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:05:13,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-08 02:05:14,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:05:14,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278617940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:14,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:05:14,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 02:05:14,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405202939] [2025-03-08 02:05:14,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:14,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:14,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:14,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:14,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:05:14,314 INFO L87 Difference]: Start difference. First operand 4939 states and 5192 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:14,955 INFO L93 Difference]: Finished difference Result 5928 states and 6205 transitions. [2025-03-08 02:05:14,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:14,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 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 405 [2025-03-08 02:05:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:14,969 INFO L225 Difference]: With dead ends: 5928 [2025-03-08 02:05:14,969 INFO L226 Difference]: Without dead ends: 5926 [2025-03-08 02:05:14,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:05:14,971 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:14,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 75 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:05:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2025-03-08 02:05:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5268. [2025-03-08 02:05:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.0506929941142966) internal successors, (5534), 5267 states have internal predecessors, (5534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5534 transitions. [2025-03-08 02:05:15,024 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5534 transitions. Word has length 405 [2025-03-08 02:05:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:15,024 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 5534 transitions. [2025-03-08 02:05:15,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5534 transitions. [2025-03-08 02:05:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2025-03-08 02:05:15,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:15,043 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:15,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:05:15,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:15,244 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:15,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:15,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1041033361, now seen corresponding path program 1 times [2025-03-08 02:05:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:15,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635752087] [2025-03-08 02:05:15,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:15,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:15,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 961 statements into 1 equivalence classes. [2025-03-08 02:05:15,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 961 of 961 statements. [2025-03-08 02:05:15,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:15,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2079 backedges. 1469 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-08 02:05:16,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:16,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635752087] [2025-03-08 02:05:16,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635752087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:16,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:16,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:05:16,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919562903] [2025-03-08 02:05:16,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:16,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:16,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:16,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:16,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:16,058 INFO L87 Difference]: Start difference. First operand 5268 states and 5534 transitions. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:16,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:16,746 INFO L93 Difference]: Finished difference Result 11850 states and 12519 transitions. [2025-03-08 02:05:16,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:16,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 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 961 [2025-03-08 02:05:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:16,762 INFO L225 Difference]: With dead ends: 11850 [2025-03-08 02:05:16,762 INFO L226 Difference]: Without dead ends: 6913 [2025-03-08 02:05:16,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:16,767 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 223 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:16,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 36 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:05:16,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-03-08 02:05:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6913. [2025-03-08 02:05:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6913 states, 6912 states have (on average 1.0533854166666667) internal successors, (7281), 6912 states have internal predecessors, (7281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 7281 transitions. [2025-03-08 02:05:16,837 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 7281 transitions. Word has length 961 [2025-03-08 02:05:16,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:16,837 INFO L471 AbstractCegarLoop]: Abstraction has 6913 states and 7281 transitions. [2025-03-08 02:05:16,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 7281 transitions. [2025-03-08 02:05:16,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2025-03-08 02:05:16,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:16,861 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:16,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:05:16,861 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:16,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:16,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2079929093, now seen corresponding path program 1 times [2025-03-08 02:05:16,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:16,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976999039] [2025-03-08 02:05:16,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:16,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:16,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1066 statements into 1 equivalence classes. [2025-03-08 02:05:16,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1066 of 1066 statements. [2025-03-08 02:05:16,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:16,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 1469 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2025-03-08 02:05:17,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:17,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976999039] [2025-03-08 02:05:17,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976999039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:17,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:17,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:05:17,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266977253] [2025-03-08 02:05:17,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:17,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:17,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:17,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:17,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:17,350 INFO L87 Difference]: Start difference. First operand 6913 states and 7281 transitions. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:17,998 INFO L93 Difference]: Finished difference Result 15140 states and 16013 transitions. [2025-03-08 02:05:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:18,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 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 1066 [2025-03-08 02:05:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:18,015 INFO L225 Difference]: With dead ends: 15140 [2025-03-08 02:05:18,015 INFO L226 Difference]: Without dead ends: 8558 [2025-03-08 02:05:18,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:18,021 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:18,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 431 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:05:18,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2025-03-08 02:05:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8229. [2025-03-08 02:05:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0480068060281964) internal successors, (8623), 8228 states have internal predecessors, (8623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8623 transitions. [2025-03-08 02:05:18,084 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8623 transitions. Word has length 1066 [2025-03-08 02:05:18,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:18,085 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8623 transitions. [2025-03-08 02:05:18,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8623 transitions. [2025-03-08 02:05:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2025-03-08 02:05:18,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:18,096 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:18,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:05:18,097 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:18,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:18,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1510534225, now seen corresponding path program 1 times [2025-03-08 02:05:18,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:18,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043096596] [2025-03-08 02:05:18,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:18,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:18,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1067 statements into 1 equivalence classes. [2025-03-08 02:05:18,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1067 of 1067 statements. [2025-03-08 02:05:18,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:18,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 1316 proven. 0 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2025-03-08 02:05:19,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:19,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043096596] [2025-03-08 02:05:19,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043096596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:19,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:19,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 02:05:19,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914880603] [2025-03-08 02:05:19,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:19,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 02:05:19,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:19,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 02:05:19,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:05:19,109 INFO L87 Difference]: Start difference. First operand 8229 states and 8623 transitions. Second operand has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:20,083 INFO L93 Difference]: Finished difference Result 16128 states and 16914 transitions. [2025-03-08 02:05:20,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 02:05:20,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 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 1067 [2025-03-08 02:05:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:20,095 INFO L225 Difference]: With dead ends: 16128 [2025-03-08 02:05:20,095 INFO L226 Difference]: Without dead ends: 8230 [2025-03-08 02:05:20,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:05:20,102 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 284 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:20,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 448 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:05:20,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8230 states. [2025-03-08 02:05:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8230 to 8229. [2025-03-08 02:05:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0466699076324746) internal successors, (8612), 8228 states have internal predecessors, (8612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8612 transitions. [2025-03-08 02:05:20,162 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8612 transitions. Word has length 1067 [2025-03-08 02:05:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:20,163 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8612 transitions. [2025-03-08 02:05:20,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8612 transitions. [2025-03-08 02:05:20,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1082 [2025-03-08 02:05:20,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:20,174 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:20,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:05:20,174 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:20,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:20,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1079699334, now seen corresponding path program 1 times [2025-03-08 02:05:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:20,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896226338] [2025-03-08 02:05:20,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:20,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:20,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1081 statements into 1 equivalence classes. [2025-03-08 02:05:20,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1081 of 1081 statements. [2025-03-08 02:05:20,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:20,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1887 backedges. 1200 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-03-08 02:05:21,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:21,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896226338] [2025-03-08 02:05:21,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896226338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:21,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:21,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:05:21,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108022077] [2025-03-08 02:05:21,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:21,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:05:21,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:21,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:05:21,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:05:21,091 INFO L87 Difference]: Start difference. First operand 8229 states and 8612 transitions. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:21,803 INFO L93 Difference]: Finished difference Result 16133 states and 16897 transitions. [2025-03-08 02:05:21,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:05:21,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 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 1081 [2025-03-08 02:05:21,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:21,814 INFO L225 Difference]: With dead ends: 16133 [2025-03-08 02:05:21,814 INFO L226 Difference]: Without dead ends: 8235 [2025-03-08 02:05:21,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:05:21,820 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:21,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:05:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8235 states. [2025-03-08 02:05:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8235 to 8229. [2025-03-08 02:05:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0464268351968886) internal successors, (8610), 8228 states have internal predecessors, (8610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8610 transitions. [2025-03-08 02:05:21,878 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8610 transitions. Word has length 1081 [2025-03-08 02:05:21,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:21,879 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8610 transitions. [2025-03-08 02:05:21,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8610 transitions. [2025-03-08 02:05:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1218 [2025-03-08 02:05:21,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:21,890 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:21,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:05:21,890 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:21,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:21,891 INFO L85 PathProgramCache]: Analyzing trace with hash -855068483, now seen corresponding path program 1 times [2025-03-08 02:05:21,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:21,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746228808] [2025-03-08 02:05:21,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:21,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:21,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1217 statements into 1 equivalence classes. [2025-03-08 02:05:21,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1217 of 1217 statements. [2025-03-08 02:05:21,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:21,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3004 backedges. 1747 proven. 0 refuted. 0 times theorem prover too weak. 1257 trivial. 0 not checked. [2025-03-08 02:05:22,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:22,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746228808] [2025-03-08 02:05:22,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746228808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:22,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:22,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:05:22,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278235823] [2025-03-08 02:05:22,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:22,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:22,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:22,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:22,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:22,826 INFO L87 Difference]: Start difference. First operand 8229 states and 8610 transitions. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:23,350 INFO L93 Difference]: Finished difference Result 17114 states and 17889 transitions. [2025-03-08 02:05:23,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:23,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1217 [2025-03-08 02:05:23,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:23,361 INFO L225 Difference]: With dead ends: 17114 [2025-03-08 02:05:23,361 INFO L226 Difference]: Without dead ends: 9216 [2025-03-08 02:05:23,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:23,368 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:23,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 439 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:05:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-03-08 02:05:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 9216. [2025-03-08 02:05:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.0422137818773738) internal successors, (9604), 9215 states have internal predecessors, (9604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:23,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9604 transitions. [2025-03-08 02:05:23,436 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9604 transitions. Word has length 1217 [2025-03-08 02:05:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:23,436 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9604 transitions. [2025-03-08 02:05:23,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9604 transitions. [2025-03-08 02:05:23,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1236 [2025-03-08 02:05:23,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:23,448 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:23,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:05:23,449 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:23,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:23,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1221372978, now seen corresponding path program 1 times [2025-03-08 02:05:23,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:23,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642641796] [2025-03-08 02:05:23,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:23,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:23,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1235 statements into 1 equivalence classes. [2025-03-08 02:05:23,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1235 of 1235 statements. [2025-03-08 02:05:23,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:23,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3034 backedges. 2214 proven. 54 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-03-08 02:05:25,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:25,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642641796] [2025-03-08 02:05:25,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642641796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:25,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427257214] [2025-03-08 02:05:25,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:25,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:25,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:25,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:05:25,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:05:25,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1235 statements into 1 equivalence classes. [2025-03-08 02:05:25,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1235 of 1235 statements. [2025-03-08 02:05:25,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:25,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:25,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 02:05:25,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3034 backedges. 1484 proven. 201 refuted. 0 times theorem prover too weak. 1349 trivial. 0 not checked. [2025-03-08 02:05:27,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:05:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3034 backedges. 1484 proven. 201 refuted. 0 times theorem prover too weak. 1349 trivial. 0 not checked. [2025-03-08 02:05:30,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427257214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:05:30,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:05:30,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-03-08 02:05:30,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106827565] [2025-03-08 02:05:30,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:05:30,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 02:05:30,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:30,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 02:05:30,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 02:05:30,318 INFO L87 Difference]: Start difference. First operand 9216 states and 9604 transitions. Second operand has 10 states, 10 states have (on average 178.6) internal successors, (1786), 10 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-08 02:05:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:33,014 INFO L93 Difference]: Finished difference Result 18761 states and 19554 transitions. [2025-03-08 02:05:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 02:05:33,014 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 178.6) internal successors, (1786), 10 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) Word has length 1235 [2025-03-08 02:05:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:33,023 INFO L225 Difference]: With dead ends: 18761 [2025-03-08 02:05:33,023 INFO L226 Difference]: Without dead ends: 9876 [2025-03-08 02:05:33,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2483 GetRequests, 2472 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 02:05:33,028 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 832 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 7052 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 7208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 7052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:33,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 97 Invalid, 7208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 7052 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 02:05:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9876 states. [2025-03-08 02:05:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9876 to 9545. [2025-03-08 02:05:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9545 states, 9544 states have (on average 1.0339480301760269) internal successors, (9868), 9544 states have internal predecessors, (9868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9545 states to 9545 states and 9868 transitions. [2025-03-08 02:05:33,095 INFO L78 Accepts]: Start accepts. Automaton has 9545 states and 9868 transitions. Word has length 1235 [2025-03-08 02:05:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:33,095 INFO L471 AbstractCegarLoop]: Abstraction has 9545 states and 9868 transitions. [2025-03-08 02:05:33,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 178.6) internal successors, (1786), 10 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-08 02:05:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 9545 states and 9868 transitions. [2025-03-08 02:05:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2025-03-08 02:05:33,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:33,111 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:33,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 02:05:33,312 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-08 02:05:33,312 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:33,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1498774413, now seen corresponding path program 1 times [2025-03-08 02:05:33,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:33,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495131340] [2025-03-08 02:05:33,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:33,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:33,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1495 statements into 1 equivalence classes. [2025-03-08 02:05:33,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1495 of 1495 statements. [2025-03-08 02:05:33,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:33,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4702 backedges. 1966 proven. 156 refuted. 0 times theorem prover too weak. 2580 trivial. 0 not checked. [2025-03-08 02:05:34,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:34,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495131340] [2025-03-08 02:05:34,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495131340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:34,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532579767] [2025-03-08 02:05:34,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:34,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:34,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:34,875 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:05:34,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 02:05:34,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1495 statements into 1 equivalence classes. [2025-03-08 02:05:35,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1495 of 1495 statements. [2025-03-08 02:05:35,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:35,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:35,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 1745 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:05:35,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4702 backedges. 2122 proven. 0 refuted. 0 times theorem prover too weak. 2580 trivial. 0 not checked. [2025-03-08 02:05:35,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:05:35,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532579767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:35,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:05:35,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 02:05:35,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272113832] [2025-03-08 02:05:35,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:35,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:35,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:35,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:35,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:05:35,552 INFO L87 Difference]: Start difference. First operand 9545 states and 9868 transitions. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:36,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:36,113 INFO L93 Difference]: Finished difference Result 20733 states and 21433 transitions. [2025-03-08 02:05:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:36,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1495 [2025-03-08 02:05:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:36,128 INFO L225 Difference]: With dead ends: 20733 [2025-03-08 02:05:36,128 INFO L226 Difference]: Without dead ends: 11519 [2025-03-08 02:05:36,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1499 GetRequests, 1494 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-08 02:05:36,136 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 173 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:36,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 96 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:05:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11519 states. [2025-03-08 02:05:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 11190. [2025-03-08 02:05:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11190 states, 11189 states have (on average 1.0309232281705247) internal successors, (11535), 11189 states have internal predecessors, (11535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 11535 transitions. [2025-03-08 02:05:36,212 INFO L78 Accepts]: Start accepts. Automaton has 11190 states and 11535 transitions. Word has length 1495 [2025-03-08 02:05:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:36,213 INFO L471 AbstractCegarLoop]: Abstraction has 11190 states and 11535 transitions. [2025-03-08 02:05:36,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 11190 states and 11535 transitions. [2025-03-08 02:05:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1583 [2025-03-08 02:05:36,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:36,229 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:36,237 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-08 02:05:36,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:36,430 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:36,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:36,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1250998890, now seen corresponding path program 1 times [2025-03-08 02:05:36,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:36,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458898580] [2025-03-08 02:05:36,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:36,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:36,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1582 statements into 1 equivalence classes. [2025-03-08 02:05:36,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1582 of 1582 statements. [2025-03-08 02:05:36,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:36,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4910 backedges. 2212 proven. 351 refuted. 0 times theorem prover too weak. 2347 trivial. 0 not checked. [2025-03-08 02:05:38,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:38,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458898580] [2025-03-08 02:05:38,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458898580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:38,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297103034] [2025-03-08 02:05:38,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:38,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:38,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:38,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:05:38,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 02:05:38,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1582 statements into 1 equivalence classes. [2025-03-08 02:05:38,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1582 of 1582 statements. [2025-03-08 02:05:38,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:38,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:38,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 1846 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:05:38,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4910 backedges. 2172 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-03-08 02:05:38,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:05:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297103034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:38,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:05:38,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 02:05:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662035655] [2025-03-08 02:05:38,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:38,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:38,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:38,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:05:38,909 INFO L87 Difference]: Start difference. First operand 11190 states and 11535 transitions. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:39,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:39,423 INFO L93 Difference]: Finished difference Result 23036 states and 23741 transitions. [2025-03-08 02:05:39,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:39,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 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 1582 [2025-03-08 02:05:39,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:39,433 INFO L225 Difference]: With dead ends: 23036 [2025-03-08 02:05:39,433 INFO L226 Difference]: Without dead ends: 11848 [2025-03-08 02:05:39,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1588 GetRequests, 1584 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:05:39,440 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 263 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:39,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 438 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:05:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2025-03-08 02:05:39,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 11848. [2025-03-08 02:05:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.029627753861737) internal successors, (12198), 11847 states have internal predecessors, (12198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12198 transitions. [2025-03-08 02:05:39,512 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12198 transitions. Word has length 1582 [2025-03-08 02:05:39,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:39,513 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12198 transitions. [2025-03-08 02:05:39,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12198 transitions. [2025-03-08 02:05:39,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1667 [2025-03-08 02:05:39,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:39,530 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:39,538 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-08 02:05:39,731 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,SelfDestructingSolverStorable14 [2025-03-08 02:05:39,731 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:39,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash -279121101, now seen corresponding path program 1 times [2025-03-08 02:05:39,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:39,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239758858] [2025-03-08 02:05:39,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:39,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:39,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1666 statements into 1 equivalence classes. [2025-03-08 02:05:39,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1666 of 1666 statements. [2025-03-08 02:05:39,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:39,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5862 backedges. 2384 proven. 459 refuted. 0 times theorem prover too weak. 3019 trivial. 0 not checked. [2025-03-08 02:05:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239758858] [2025-03-08 02:05:41,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239758858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909514162] [2025-03-08 02:05:41,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:41,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:41,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:41,698 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:05:41,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 02:05:41,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1666 statements into 1 equivalence classes. [2025-03-08 02:05:41,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1666 of 1666 statements. [2025-03-08 02:05:41,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:41,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:41,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1938 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:05:41,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5862 backedges. 1941 proven. 0 refuted. 0 times theorem prover too weak. 3921 trivial. 0 not checked. [2025-03-08 02:05:42,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:05:42,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909514162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:42,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:05:42,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 02:05:42,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246674071] [2025-03-08 02:05:42,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:42,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:42,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:42,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:42,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:05:42,233 INFO L87 Difference]: Start difference. First operand 11848 states and 12198 transitions. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:42,807 INFO L93 Difference]: Finished difference Result 23694 states and 24394 transitions. [2025-03-08 02:05:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:42,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 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 1666 [2025-03-08 02:05:42,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:42,817 INFO L225 Difference]: With dead ends: 23694 [2025-03-08 02:05:42,817 INFO L226 Difference]: Without dead ends: 11848 [2025-03-08 02:05:42,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1672 GetRequests, 1668 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:05:42,825 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 118 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:42,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 421 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:05:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2025-03-08 02:05:42,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 11848. [2025-03-08 02:05:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0260825525449482) internal successors, (12156), 11847 states have internal predecessors, (12156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12156 transitions. [2025-03-08 02:05:42,941 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12156 transitions. Word has length 1666 [2025-03-08 02:05:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:42,941 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12156 transitions. [2025-03-08 02:05:42,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:42,942 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12156 transitions. [2025-03-08 02:05:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2078 [2025-03-08 02:05:42,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:42,964 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:42,972 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-08 02:05:43,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 02:05:43,165 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:43,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:43,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1305618353, now seen corresponding path program 1 times [2025-03-08 02:05:43,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:43,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398300061] [2025-03-08 02:05:43,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:43,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:43,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2077 statements into 1 equivalence classes. [2025-03-08 02:05:43,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2077 of 2077 statements. [2025-03-08 02:05:43,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:43,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9012 backedges. 4142 proven. 0 refuted. 0 times theorem prover too weak. 4870 trivial. 0 not checked. [2025-03-08 02:05:45,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:45,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398300061] [2025-03-08 02:05:45,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398300061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:45,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:45,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:05:45,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376439915] [2025-03-08 02:05:45,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:45,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:45,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:45,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:45,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:45,168 INFO L87 Difference]: Start difference. First operand 11848 states and 12156 transitions. Second operand has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:45,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:45,751 INFO L93 Difference]: Finished difference Result 28629 states and 29361 transitions. [2025-03-08 02:05:45,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:45,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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 2077 [2025-03-08 02:05:45,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:45,763 INFO L225 Difference]: With dead ends: 28629 [2025-03-08 02:05:45,763 INFO L226 Difference]: Without dead ends: 16783 [2025-03-08 02:05:45,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:45,770 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 208 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:45,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 55 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:05:45,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16783 states. [2025-03-08 02:05:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16783 to 13493. [2025-03-08 02:05:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0269048324933294) internal successors, (13855), 13492 states have internal predecessors, (13855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13855 transitions. [2025-03-08 02:05:45,902 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13855 transitions. Word has length 2077 [2025-03-08 02:05:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:45,902 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13855 transitions. [2025-03-08 02:05:45,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13855 transitions. [2025-03-08 02:05:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2119 [2025-03-08 02:05:45,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:45,925 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:45,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:05:45,925 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:45,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:45,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1090875405, now seen corresponding path program 1 times [2025-03-08 02:05:45,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:45,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932630271] [2025-03-08 02:05:45,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:45,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:46,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2118 statements into 1 equivalence classes. [2025-03-08 02:05:46,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2118 of 2118 statements. [2025-03-08 02:05:46,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:46,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9910 backedges. 6773 proven. 132 refuted. 0 times theorem prover too weak. 3005 trivial. 0 not checked. [2025-03-08 02:05:47,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:47,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932630271] [2025-03-08 02:05:47,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932630271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:47,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577958985] [2025-03-08 02:05:47,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:47,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:47,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:47,709 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-08 02:05:47,710 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-08 02:05:47,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2118 statements into 1 equivalence classes. [2025-03-08 02:05:48,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2118 of 2118 statements. [2025-03-08 02:05:48,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:48,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:48,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 2452 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:05:48,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:48,197 INFO L134 CoverageAnalysis]: Checked inductivity of 9910 backedges. 5690 proven. 0 refuted. 0 times theorem prover too weak. 4220 trivial. 0 not checked. [2025-03-08 02:05:48,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:05:48,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577958985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:48,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:05:48,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 02:05:48,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42335406] [2025-03-08 02:05:48,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:48,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:48,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:48,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:48,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:05:48,201 INFO L87 Difference]: Start difference. First operand 13493 states and 13855 transitions. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:48,794 INFO L93 Difference]: Finished difference Result 30603 states and 31444 transitions. [2025-03-08 02:05:48,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:48,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 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 2118 [2025-03-08 02:05:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:48,809 INFO L225 Difference]: With dead ends: 30603 [2025-03-08 02:05:48,809 INFO L226 Difference]: Without dead ends: 17112 [2025-03-08 02:05:48,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2122 GetRequests, 2118 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-08 02:05:48,818 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 221 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:48,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 433 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:05:48,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2025-03-08 02:05:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 16783. [2025-03-08 02:05:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.0242521749493505) internal successors, (17189), 16782 states have internal predecessors, (17189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17189 transitions. [2025-03-08 02:05:48,935 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17189 transitions. Word has length 2118 [2025-03-08 02:05:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:48,936 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17189 transitions. [2025-03-08 02:05:48,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17189 transitions. [2025-03-08 02:05:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2196 [2025-03-08 02:05:48,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:48,963 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:48,971 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-08 02:05:49,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 02:05:49,163 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:49,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:49,164 INFO L85 PathProgramCache]: Analyzing trace with hash 917904384, now seen corresponding path program 1 times [2025-03-08 02:05:49,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:49,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782282502] [2025-03-08 02:05:49,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:49,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2195 statements into 1 equivalence classes. [2025-03-08 02:05:49,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2195 of 2195 statements. [2025-03-08 02:05:49,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:49,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9974 backedges. 7026 proven. 91 refuted. 0 times theorem prover too weak. 2857 trivial. 0 not checked. [2025-03-08 02:05:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:51,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782282502] [2025-03-08 02:05:51,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782282502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:51,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64010462] [2025-03-08 02:05:51,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:51,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:51,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:51,509 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-08 02:05:51,510 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-08 02:05:51,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2195 statements into 1 equivalence classes. [2025-03-08 02:05:51,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2195 of 2195 statements. [2025-03-08 02:05:51,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:51,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:51,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:05:51,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9974 backedges. 767 proven. 0 refuted. 0 times theorem prover too weak. 9207 trivial. 0 not checked. [2025-03-08 02:05:51,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:05:51,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64010462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:51,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:05:51,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 02:05:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610705069] [2025-03-08 02:05:51,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:51,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:51,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:51,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:05:51,985 INFO L87 Difference]: Start difference. First operand 16783 states and 17189 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:52,615 INFO L93 Difference]: Finished difference Result 17443 states and 17857 transitions. [2025-03-08 02:05:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:52,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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 2195 [2025-03-08 02:05:52,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:52,631 INFO L225 Difference]: With dead ends: 17443 [2025-03-08 02:05:52,631 INFO L226 Difference]: Without dead ends: 17441 [2025-03-08 02:05:52,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2200 GetRequests, 2195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:05:52,636 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 268 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:52,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 433 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:05:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2025-03-08 02:05:52,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 16783. [2025-03-08 02:05:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.0242521749493505) internal successors, (17189), 16782 states have internal predecessors, (17189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17189 transitions. [2025-03-08 02:05:52,758 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17189 transitions. Word has length 2195 [2025-03-08 02:05:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:52,759 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17189 transitions. [2025-03-08 02:05:52,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17189 transitions. [2025-03-08 02:05:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2239 [2025-03-08 02:05:52,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:52,787 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:52,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 02:05:52,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:52,992 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:52,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:52,993 INFO L85 PathProgramCache]: Analyzing trace with hash -148016506, now seen corresponding path program 1 times [2025-03-08 02:05:52,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:52,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200690693] [2025-03-08 02:05:52,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:52,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:53,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2238 statements into 1 equivalence classes. [2025-03-08 02:05:53,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2238 of 2238 statements. [2025-03-08 02:05:53,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:53,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10931 backedges. 2030 proven. 0 refuted. 0 times theorem prover too weak. 8901 trivial. 0 not checked. [2025-03-08 02:05:54,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:54,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200690693] [2025-03-08 02:05:54,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200690693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:54,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:54,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:05:54,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121465648] [2025-03-08 02:05:54,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:54,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:54,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:54,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:54,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:54,386 INFO L87 Difference]: Start difference. First operand 16783 states and 17189 transitions. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:55,012 INFO L93 Difference]: Finished difference Result 36196 states and 37102 transitions. [2025-03-08 02:05:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:55,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 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 2238 [2025-03-08 02:05:55,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:55,030 INFO L225 Difference]: With dead ends: 36196 [2025-03-08 02:05:55,030 INFO L226 Difference]: Without dead ends: 19415 [2025-03-08 02:05:55,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:55,040 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 229 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:55,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 429 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:05:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19415 states. [2025-03-08 02:05:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19415 to 18757. [2025-03-08 02:05:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18757 states, 18756 states have (on average 1.0228193644700363) internal successors, (19184), 18756 states have internal predecessors, (19184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18757 states to 18757 states and 19184 transitions. [2025-03-08 02:05:55,234 INFO L78 Accepts]: Start accepts. Automaton has 18757 states and 19184 transitions. Word has length 2238 [2025-03-08 02:05:55,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:55,234 INFO L471 AbstractCegarLoop]: Abstraction has 18757 states and 19184 transitions. [2025-03-08 02:05:55,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:55,234 INFO L276 IsEmpty]: Start isEmpty. Operand 18757 states and 19184 transitions. [2025-03-08 02:05:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2361 [2025-03-08 02:05:55,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:55,265 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-08 02:05:55,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:05:55,266 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:55,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:55,267 INFO L85 PathProgramCache]: Analyzing trace with hash 769971760, now seen corresponding path program 1 times [2025-03-08 02:05:55,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:55,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83566138] [2025-03-08 02:05:55,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:55,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:55,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2360 statements into 1 equivalence classes. [2025-03-08 02:05:55,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2360 of 2360 statements. [2025-03-08 02:05:55,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:55,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10948 backedges. 6684 proven. 0 refuted. 0 times theorem prover too weak. 4264 trivial. 0 not checked. [2025-03-08 02:05:57,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:57,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83566138] [2025-03-08 02:05:57,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83566138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:57,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:57,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 02:05:57,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760862419] [2025-03-08 02:05:57,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:57,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 02:05:57,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:57,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 02:05:57,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:05:57,162 INFO L87 Difference]: Start difference. First operand 18757 states and 19184 transitions. Second operand has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:58,320 INFO L93 Difference]: Finished difference Result 38533 states and 39381 transitions. [2025-03-08 02:05:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 02:05:58,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 0 states have call successors, (0), 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 2360 [2025-03-08 02:05:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:58,322 INFO L225 Difference]: With dead ends: 38533 [2025-03-08 02:05:58,322 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 02:05:58,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:05:58,334 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 142 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:58,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 436 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:05:58,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 02:05:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 02:05:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 02:05:58,335 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2360 [2025-03-08 02:05:58,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:58,335 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 02:05:58,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 02:05:58,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 02:05:58,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 02:05:58,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:05:58,341 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] [2025-03-08 02:05:58,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 02:05:59,126 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 02:05:59,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:05:59 BoogieIcfgContainer [2025-03-08 02:05:59,143 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 02:05:59,144 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 02:05:59,144 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 02:05:59,144 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 02:05:59,146 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:05" (3/4) ... [2025-03-08 02:05:59,148 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 02:05:59,175 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 02:05:59,176 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 02:05:59,178 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 02:05:59,179 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 02:05:59,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 02:05:59,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 02:05:59,313 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 02:05:59,315 INFO L158 Benchmark]: Toolchain (without parser) took 56843.97ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 108.4MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 153.5MB. Max. memory is 16.1GB. [2025-03-08 02:05:59,315 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:05:59,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.72ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 50.9MB in the end (delta: 57.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 02:05:59,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.78ms. Allocated memory is still 142.6MB. Free memory was 50.9MB in the beginning and 91.2MB in the end (delta: -40.2MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2025-03-08 02:05:59,316 INFO L158 Benchmark]: Boogie Preprocessor took 156.87ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 58.3MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 02:05:59,316 INFO L158 Benchmark]: IcfgBuilder took 1832.72ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 58.3MB in the beginning and 368.6MB in the end (delta: -310.3MB). Peak memory consumption was 204.2MB. Max. memory is 16.1GB. [2025-03-08 02:05:59,316 INFO L158 Benchmark]: TraceAbstraction took 54033.55ms. Allocated memory was 419.4MB in the beginning and 2.3GB in the end (delta: 1.8GB). Free memory was 364.9MB in the beginning and 2.1GB in the end (delta: -1.7GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-03-08 02:05:59,316 INFO L158 Benchmark]: Witness Printer took 169.60ms. Allocated memory is still 2.3GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 02:05:59,317 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.27ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.72ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 50.9MB in the end (delta: 57.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.78ms. Allocated memory is still 142.6MB. Free memory was 50.9MB in the beginning and 91.2MB in the end (delta: -40.2MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 156.87ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 58.3MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1832.72ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 58.3MB in the beginning and 368.6MB in the end (delta: -310.3MB). Peak memory consumption was 204.2MB. Max. memory is 16.1GB. * TraceAbstraction took 54033.55ms. Allocated memory was 419.4MB in the beginning and 2.3GB in the end (delta: 1.8GB). Free memory was 364.9MB in the beginning and 2.1GB in the end (delta: -1.7GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 169.60ms. Allocated memory is still 2.3GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 215]: 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, 396 locations, 722 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.2s, OverallIterations: 21, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6252 SdHoareTripleChecker+Valid, 17.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6252 mSDsluCounter, 6198 SdHoareTripleChecker+Invalid, 14.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 233 mSDsCounter, 2798 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26867 IncrementalHoareTripleChecker+Invalid, 29665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2798 mSolverCounterUnsat, 5965 mSDtfsCounter, 26867 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12025 GetRequests, 11962 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18757occurred in iteration=20, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 7247 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 26.8s InterpolantComputationTime, 34638 NumberOfCodeBlocks, 34638 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 35844 ConstructedInterpolants, 0 QuantifiedInterpolants, 88262 SizeOfPredicates, 2 NumberOfNonLiveVariables, 12437 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 121118/122805 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: 1783]: Location Invariant Derived location invariant: (((((((((((((((((a16 <= 8) && (a15 == 4)) || ((((a12 <= 5) && (a15 == 4)) && (158 <= a18)) && (a16 <= 11))) || ((((a16 == 9) && (a15 <= 3)) && (((long long) a18 + 156) <= 0)) && (7 == a12))) || ((((a12 == 9) && (a16 == 9)) && (158 <= a18)) && (a15 == 3))) || (((((a12 == 9) && (a16 == 9)) && (0 <= ((long long) 44 + a18))) && (a15 == 3)) && (a18 <= 134))) || (((a15 <= 3) && (a12 == 6)) && (a16 <= 11))) || ((((a16 == 9) && (a15 == 4)) && (a12 == 8)) && (a18 <= 132))) || (((a15 == 4) && (a12 == 6)) && (a16 <= 11))) || (((a12 <= 5) && (a15 <= 3)) && (a16 <= 11))) || (((a15 <= 3) && (a12 == 8)) && (a16 <= 11))) || (((a12 == 9) && (a16 == 9)) && (a15 == 4))) || (((a16 == 9) && (a15 == 4)) && (7 == a12))) || ((((((long long) a18 + 79) <= 0) && (a12 <= 5)) && (a15 == 4)) && (a16 <= 11))) || ((a16 <= 8) && (a15 <= 3))) || (((a15 <= 3) && (11 <= a16)) && (((5 != a12) || (0 < ((long long) a18 + 156))) || (a16 != 12)))) || ((((a15 <= 3) && (137 <= a18)) && (a16 <= 11)) && (7 == a12))) RESULT: Ultimate proved your program to be correct! [2025-03-08 02:05:59,335 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