./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label20.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 cc39b25e5d6bf00ba7a149cc452827f6c69f8a46e091e8e5858372a0b5fafb1a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:58:01,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:58:01,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:58:01,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:58:01,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:58:01,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:58:01,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:58:01,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:58:01,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:58:01,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:58:01,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:58:01,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:58:01,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:58:01,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:58:01,863 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:58:01,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:58:01,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:58:01,863 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:58:01,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:58:01,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:58:01,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:58:01,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:58:01,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:58:01,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:58:01,864 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:58:01,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:58:01,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:58:01,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:58:01,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:58:01,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:58:01,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:58:01,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:58:01,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:58:01,865 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-jdk21/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 -> cc39b25e5d6bf00ba7a149cc452827f6c69f8a46e091e8e5858372a0b5fafb1a [2025-01-08 23:58:02,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:58:02,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:58:02,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:58:02,160 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:58:02,160 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:58:02,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label20.c [2025-01-08 23:58:03,269 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a22d56cb/f63ee11e3bfe40e9b00efeb63f35575d/FLAG8601539c6 [2025-01-08 23:58:03,609 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:58:03,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label20.c [2025-01-08 23:58:03,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a22d56cb/f63ee11e3bfe40e9b00efeb63f35575d/FLAG8601539c6 [2025-01-08 23:58:03,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a22d56cb/f63ee11e3bfe40e9b00efeb63f35575d [2025-01-08 23:58:03,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:58:03,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:58:03,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:58:03,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:58:03,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:58:03,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:58:03" (1/1) ... [2025-01-08 23:58:03,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292d107d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:03, skipping insertion in model container [2025-01-08 23:58:03,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:58:03" (1/1) ... [2025-01-08 23:58:03,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:58:03,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label20.c[6130,6143] [2025-01-08 23:58:03,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:58:03,931 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:58:03,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label20.c[6130,6143] [2025-01-08 23:58:03,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:58:04,001 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:58:04,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04 WrapperNode [2025-01-08 23:58:04,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:58:04,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:58:04,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:58:04,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:58:04,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04" (1/1) ... [2025-01-08 23:58:04,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04" (1/1) ... [2025-01-08 23:58:04,057 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-01-08 23:58:04,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:58:04,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:58:04,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:58:04,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:58:04,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04" (1/1) ... [2025-01-08 23:58:04,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04" (1/1) ... [2025-01-08 23:58:04,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04" (1/1) ... [2025-01-08 23:58:04,106 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-01-08 23:58:04,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04" (1/1) ... [2025-01-08 23:58:04,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04" (1/1) ... [2025-01-08 23:58:04,121 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04" (1/1) ... [2025-01-08 23:58:04,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04" (1/1) ... [2025-01-08 23:58:04,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04" (1/1) ... [2025-01-08 23:58:04,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04" (1/1) ... [2025-01-08 23:58:04,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04" (1/1) ... [2025-01-08 23:58:04,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:58:04,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:58:04,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:58:04,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:58:04,146 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04" (1/1) ... [2025-01-08 23:58:04,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:58:04,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:04,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:58:04,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:58:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:58:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:58:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:58:04,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:58:04,239 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:58:04,240 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:58:05,227 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-01-08 23:58:05,228 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:58:05,243 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:58:05,246 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:58:05,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:58:05 BoogieIcfgContainer [2025-01-08 23:58:05,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:58:05,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:58:05,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:58:05,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:58:05,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:58:03" (1/3) ... [2025-01-08 23:58:05,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c11489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:58:05, skipping insertion in model container [2025-01-08 23:58:05,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:04" (2/3) ... [2025-01-08 23:58:05,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c11489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:58:05, skipping insertion in model container [2025-01-08 23:58:05,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:58:05" (3/3) ... [2025-01-08 23:58:05,254 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label20.c [2025-01-08 23:58:05,263 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:58:05,264 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label20.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:58:05,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:58:05,317 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;@4f16781f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:58:05,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:58:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-08 23:58:05,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:05,327 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] [2025-01-08 23:58:05,328 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:05,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:05,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1396635870, now seen corresponding path program 1 times [2025-01-08 23:58:05,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:05,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246788725] [2025-01-08 23:58:05,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:05,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:05,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-08 23:58:05,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-08 23:58:05,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:05,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:58:05,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:05,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246788725] [2025-01-08 23:58:05,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246788725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:05,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:05,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:58:05,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600379432] [2025-01-08 23:58:05,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:05,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:05,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:05,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:05,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:05,635 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 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 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:06,271 INFO L93 Difference]: Finished difference Result 669 states and 1197 transitions. [2025-01-08 23:58:06,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:06,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-01-08 23:58:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:06,279 INFO L225 Difference]: With dead ends: 669 [2025-01-08 23:58:06,280 INFO L226 Difference]: Without dead ends: 360 [2025-01-08 23:58:06,282 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-01-08 23:58:06,283 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:06,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 77 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:58:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-08 23:58:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-01-08 23:58:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.6378830083565459) internal successors, (588), 359 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-01-08 23:58:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 588 transitions. [2025-01-08 23:58:06,317 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 588 transitions. Word has length 60 [2025-01-08 23:58:06,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:06,317 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 588 transitions. [2025-01-08 23:58:06,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 588 transitions. [2025-01-08 23:58:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-08 23:58:06,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:06,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:06,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:58:06,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:06,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:06,321 INFO L85 PathProgramCache]: Analyzing trace with hash -235893037, now seen corresponding path program 1 times [2025-01-08 23:58:06,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:06,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467562801] [2025-01-08 23:58:06,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:06,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:06,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-08 23:58:06,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-08 23:58:06,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:06,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:58:06,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:06,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467562801] [2025-01-08 23:58:06,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467562801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:06,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:06,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:58:06,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28264838] [2025-01-08 23:58:06,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:06,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:06,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:06,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:06,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:06,450 INFO L87 Difference]: Start difference. First operand 360 states and 588 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:06,956 INFO L93 Difference]: Finished difference Result 1074 states and 1759 transitions. [2025-01-08 23:58:06,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:06,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-01-08 23:58:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:06,959 INFO L225 Difference]: With dead ends: 1074 [2025-01-08 23:58:06,959 INFO L226 Difference]: Without dead ends: 716 [2025-01-08 23:58:06,960 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-01-08 23:58:06,960 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 117 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:06,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 51 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:58:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-08 23:58:06,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-01-08 23:58:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.523076923076923) internal successors, (1089), 715 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1089 transitions. [2025-01-08 23:58:06,981 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1089 transitions. Word has length 125 [2025-01-08 23:58:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:06,982 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1089 transitions. [2025-01-08 23:58:06,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1089 transitions. [2025-01-08 23:58:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-08 23:58:06,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:06,985 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:06,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:58:06,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:06,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash -4203055, now seen corresponding path program 1 times [2025-01-08 23:58:06,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:06,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856377619] [2025-01-08 23:58:06,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:06,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:07,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-08 23:58:07,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-08 23:58:07,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:07,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:58:07,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:07,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856377619] [2025-01-08 23:58:07,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856377619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:07,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:07,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:58:07,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384906230] [2025-01-08 23:58:07,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:07,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:07,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:07,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:07,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:07,093 INFO L87 Difference]: Start difference. First operand 716 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:07,606 INFO L93 Difference]: Finished difference Result 1786 states and 2718 transitions. [2025-01-08 23:58:07,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:07,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-08 23:58:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:07,610 INFO L225 Difference]: With dead ends: 1786 [2025-01-08 23:58:07,612 INFO L226 Difference]: Without dead ends: 1072 [2025-01-08 23:58:07,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:07,616 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:07,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:58:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-01-08 23:58:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2025-01-08 23:58:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.377217553688142) internal successors, (1475), 1071 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:07,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1475 transitions. [2025-01-08 23:58:07,656 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1475 transitions. Word has length 126 [2025-01-08 23:58:07,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:07,657 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1475 transitions. [2025-01-08 23:58:07,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1475 transitions. [2025-01-08 23:58:07,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-08 23:58:07,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:07,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:07,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:58:07,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:07,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:07,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1669597772, now seen corresponding path program 1 times [2025-01-08 23:58:07,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:07,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262038395] [2025-01-08 23:58:07,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:07,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:07,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-08 23:58:07,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-08 23:58:07,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:07,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:58:07,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:07,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262038395] [2025-01-08 23:58:07,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262038395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:07,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:07,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:58:07,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131783702] [2025-01-08 23:58:07,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:07,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:07,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:07,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:07,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:07,829 INFO L87 Difference]: Start difference. First operand 1072 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:08,391 INFO L93 Difference]: Finished difference Result 2856 states and 3879 transitions. [2025-01-08 23:58:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:08,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-01-08 23:58:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:08,404 INFO L225 Difference]: With dead ends: 2856 [2025-01-08 23:58:08,405 INFO L226 Difference]: Without dead ends: 1786 [2025-01-08 23:58:08,406 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-01-08 23:58:08,410 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:08,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 106 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:58:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2025-01-08 23:58:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1784. [2025-01-08 23:58:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.274817722938867) internal successors, (2273), 1783 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2273 transitions. [2025-01-08 23:58:08,489 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2273 transitions. Word has length 128 [2025-01-08 23:58:08,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:08,490 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2273 transitions. [2025-01-08 23:58:08,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2273 transitions. [2025-01-08 23:58:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-08 23:58:08,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:08,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:08,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:58:08,495 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:08,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash 450149385, now seen corresponding path program 1 times [2025-01-08 23:58:08,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:08,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327926741] [2025-01-08 23:58:08,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:08,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:08,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-08 23:58:08,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-08 23:58:08,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:08,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:58:08,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:08,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327926741] [2025-01-08 23:58:08,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327926741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:08,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:08,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:08,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832978100] [2025-01-08 23:58:08,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:08,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:58:08,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:08,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:58:08,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:08,753 INFO L87 Difference]: Start difference. First operand 1784 states and 2273 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:09,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:09,496 INFO L93 Difference]: Finished difference Result 3568 states and 4551 transitions. [2025-01-08 23:58:09,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:58:09,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-01-08 23:58:09,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:09,504 INFO L225 Difference]: With dead ends: 3568 [2025-01-08 23:58:09,504 INFO L226 Difference]: Without dead ends: 1964 [2025-01-08 23:58:09,507 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-01-08 23:58:09,509 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 441 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:09,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 123 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:58:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2025-01-08 23:58:09,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1962. [2025-01-08 23:58:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.2437531871494136) internal successors, (2439), 1961 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:09,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2439 transitions. [2025-01-08 23:58:09,545 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2439 transitions. Word has length 129 [2025-01-08 23:58:09,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:09,545 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2439 transitions. [2025-01-08 23:58:09,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2439 transitions. [2025-01-08 23:58:09,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-08 23:58:09,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:09,546 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, 1, 1, 1, 1, 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-01-08 23:58:09,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:58:09,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:09,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:09,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1366518062, now seen corresponding path program 1 times [2025-01-08 23:58:09,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:09,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347268652] [2025-01-08 23:58:09,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:09,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:09,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-08 23:58:09,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-08 23:58:09,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:09,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:58:09,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:09,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347268652] [2025-01-08 23:58:09,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347268652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:09,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:09,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:09,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140523346] [2025-01-08 23:58:09,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:09,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:58:09,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:09,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:58:09,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:09,789 INFO L87 Difference]: Start difference. First operand 1962 states and 2439 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:10,518 INFO L93 Difference]: Finished difference Result 4131 states and 5121 transitions. [2025-01-08 23:58:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:58:10,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-01-08 23:58:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:10,525 INFO L225 Difference]: With dead ends: 4131 [2025-01-08 23:58:10,525 INFO L226 Difference]: Without dead ends: 2320 [2025-01-08 23:58:10,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:10,528 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 112 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:10,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 121 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:58:10,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2025-01-08 23:58:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2318. [2025-01-08 23:58:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.1294777729823047) internal successors, (2617), 2317 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2617 transitions. [2025-01-08 23:58:10,563 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2617 transitions. Word has length 140 [2025-01-08 23:58:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:10,564 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2617 transitions. [2025-01-08 23:58:10,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2617 transitions. [2025-01-08 23:58:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-01-08 23:58:10,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:10,567 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:10,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:58:10,567 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:10,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash -66499225, now seen corresponding path program 1 times [2025-01-08 23:58:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:10,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971092489] [2025-01-08 23:58:10,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:10,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:10,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-08 23:58:10,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-08 23:58:10,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:10,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:58:10,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:10,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971092489] [2025-01-08 23:58:10,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971092489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:10,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:10,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:10,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232927313] [2025-01-08 23:58:10,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:10,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:10,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:10,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:10,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:10,894 INFO L87 Difference]: Start difference. First operand 2318 states and 2617 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:11,317 INFO L93 Difference]: Finished difference Result 4990 states and 5682 transitions. [2025-01-08 23:58:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:11,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2025-01-08 23:58:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:11,325 INFO L225 Difference]: With dead ends: 4990 [2025-01-08 23:58:11,325 INFO L226 Difference]: Without dead ends: 2852 [2025-01-08 23:58:11,327 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-01-08 23:58:11,328 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 112 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:11,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 76 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2025-01-08 23:58:11,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2025-01-08 23:58:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.122763942476324) internal successors, (3201), 2851 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3201 transitions. [2025-01-08 23:58:11,372 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3201 transitions. Word has length 340 [2025-01-08 23:58:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:11,373 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3201 transitions. [2025-01-08 23:58:11,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3201 transitions. [2025-01-08 23:58:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-01-08 23:58:11,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:11,380 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 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] [2025-01-08 23:58:11,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:58:11,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:11,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:11,381 INFO L85 PathProgramCache]: Analyzing trace with hash -643501808, now seen corresponding path program 1 times [2025-01-08 23:58:11,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:11,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033348236] [2025-01-08 23:58:11,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:11,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:11,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-08 23:58:11,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-08 23:58:11,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:11,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-01-08 23:58:11,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:11,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033348236] [2025-01-08 23:58:11,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033348236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:11,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:11,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800373846] [2025-01-08 23:58:11,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:11,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:58:11,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:11,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:58:11,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:11,664 INFO L87 Difference]: Start difference. First operand 2852 states and 3201 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:12,151 INFO L93 Difference]: Finished difference Result 5760 states and 6476 transitions. [2025-01-08 23:58:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:58:12,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 351 [2025-01-08 23:58:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:12,160 INFO L225 Difference]: With dead ends: 5760 [2025-01-08 23:58:12,160 INFO L226 Difference]: Without dead ends: 3030 [2025-01-08 23:58:12,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:12,163 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:12,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:58:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2025-01-08 23:58:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2852. [2025-01-08 23:58:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.0824272185198176) internal successors, (3086), 2851 states have internal predecessors, (3086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3086 transitions. [2025-01-08 23:58:12,203 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3086 transitions. Word has length 351 [2025-01-08 23:58:12,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:12,203 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3086 transitions. [2025-01-08 23:58:12,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:12,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3086 transitions. [2025-01-08 23:58:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-01-08 23:58:12,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:12,211 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:58:12,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:58:12,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:12,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:12,211 INFO L85 PathProgramCache]: Analyzing trace with hash 745459324, now seen corresponding path program 2 times [2025-01-08 23:58:12,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:12,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676428128] [2025-01-08 23:58:12,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 23:58:12,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:12,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 446 statements into 2 equivalence classes. [2025-01-08 23:58:12,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 446 of 446 statements. [2025-01-08 23:58:12,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 23:58:12,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-01-08 23:58:12,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:12,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676428128] [2025-01-08 23:58:12,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676428128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:12,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:12,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:12,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185581149] [2025-01-08 23:58:12,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:12,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:12,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:12,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:12,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:12,441 INFO L87 Difference]: Start difference. First operand 2852 states and 3086 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:12,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:12,819 INFO L93 Difference]: Finished difference Result 5168 states and 5620 transitions. [2025-01-08 23:58:12,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:12,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 446 [2025-01-08 23:58:12,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:12,827 INFO L225 Difference]: With dead ends: 5168 [2025-01-08 23:58:12,827 INFO L226 Difference]: Without dead ends: 2496 [2025-01-08 23:58:12,830 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-01-08 23:58:12,832 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 121 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:12,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 247 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-01-08 23:58:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2318. [2025-01-08 23:58:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.081570996978852) internal successors, (2506), 2317 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2506 transitions. [2025-01-08 23:58:12,867 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2506 transitions. Word has length 446 [2025-01-08 23:58:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:12,867 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2506 transitions. [2025-01-08 23:58:12,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2506 transitions. [2025-01-08 23:58:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-08 23:58:12,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:12,872 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:12,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:58:12,873 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:12,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:12,876 INFO L85 PathProgramCache]: Analyzing trace with hash -456030781, now seen corresponding path program 1 times [2025-01-08 23:58:12,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:12,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519083397] [2025-01-08 23:58:12,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:12,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:12,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-08 23:58:12,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-08 23:58:12,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:12,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 417 proven. 150 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-01-08 23:58:13,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:13,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519083397] [2025-01-08 23:58:13,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519083397] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:13,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586442439] [2025-01-08 23:58:13,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:13,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:13,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:13,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:13,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:58:13,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-08 23:58:13,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-08 23:58:13,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:13,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:13,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:13,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-01-08 23:58:13,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:13,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586442439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:13,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:13,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:58:13,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126265751] [2025-01-08 23:58:13,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:13,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:13,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:13,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:13,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:13,730 INFO L87 Difference]: Start difference. First operand 2318 states and 2506 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:14,125 INFO L93 Difference]: Finished difference Result 4990 states and 5471 transitions. [2025-01-08 23:58:14,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:14,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 456 [2025-01-08 23:58:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:14,132 INFO L225 Difference]: With dead ends: 4990 [2025-01-08 23:58:14,132 INFO L226 Difference]: Without dead ends: 2852 [2025-01-08 23:58:14,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:14,135 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 121 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:14,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 234 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2025-01-08 23:58:14,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2025-01-08 23:58:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.0849233071455293) internal successors, (2900), 2673 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2900 transitions. [2025-01-08 23:58:14,168 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2900 transitions. Word has length 456 [2025-01-08 23:58:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:14,169 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 2900 transitions. [2025-01-08 23:58:14,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2900 transitions. [2025-01-08 23:58:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-01-08 23:58:14,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:14,175 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-01-08 23:58:14,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:58:14,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-08 23:58:14,375 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:14,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:14,377 INFO L85 PathProgramCache]: Analyzing trace with hash 892414934, now seen corresponding path program 1 times [2025-01-08 23:58:14,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:14,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708364874] [2025-01-08 23:58:14,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:14,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:14,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-01-08 23:58:14,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-01-08 23:58:14,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:14,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-01-08 23:58:14,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:14,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708364874] [2025-01-08 23:58:14,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708364874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:14,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:14,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:58:14,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560353027] [2025-01-08 23:58:14,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:14,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:58:14,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:14,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:58:14,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:58:14,793 INFO L87 Difference]: Start difference. First operand 2674 states and 2900 transitions. Second operand has 5 states, 5 states have (on average 66.0) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:15,491 INFO L93 Difference]: Finished difference Result 5702 states and 6192 transitions. [2025-01-08 23:58:15,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:58:15,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.0) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 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 538 [2025-01-08 23:58:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:15,498 INFO L225 Difference]: With dead ends: 5702 [2025-01-08 23:58:15,499 INFO L226 Difference]: Without dead ends: 3208 [2025-01-08 23:58:15,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:15,501 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 145 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:15,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 62 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:58:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2025-01-08 23:58:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3030. [2025-01-08 23:58:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3030 states, 3029 states have (on average 1.0775833608451635) internal successors, (3264), 3029 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3264 transitions. [2025-01-08 23:58:15,534 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3264 transitions. Word has length 538 [2025-01-08 23:58:15,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:15,535 INFO L471 AbstractCegarLoop]: Abstraction has 3030 states and 3264 transitions. [2025-01-08 23:58:15,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.0) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3264 transitions. [2025-01-08 23:58:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-01-08 23:58:15,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:15,542 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:15,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:58:15,542 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:15,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:15,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2090692915, now seen corresponding path program 1 times [2025-01-08 23:58:15,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:15,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168433040] [2025-01-08 23:58:15,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:15,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:15,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-01-08 23:58:15,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-01-08 23:58:15,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:15,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 829 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-01-08 23:58:15,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:15,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168433040] [2025-01-08 23:58:15,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168433040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:15,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:15,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:15,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224547640] [2025-01-08 23:58:15,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:15,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:15,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:15,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:15,955 INFO L87 Difference]: Start difference. First operand 3030 states and 3264 transitions. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:16,348 INFO L93 Difference]: Finished difference Result 6770 states and 7326 transitions. [2025-01-08 23:58:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:16,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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 614 [2025-01-08 23:58:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:16,357 INFO L225 Difference]: With dead ends: 6770 [2025-01-08 23:58:16,357 INFO L226 Difference]: Without dead ends: 3920 [2025-01-08 23:58:16,360 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-01-08 23:58:16,360 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:16,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 242 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:16,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2025-01-08 23:58:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3386. [2025-01-08 23:58:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.0729689807976366) internal successors, (3632), 3385 states have internal predecessors, (3632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3632 transitions. [2025-01-08 23:58:16,439 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3632 transitions. Word has length 614 [2025-01-08 23:58:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:16,440 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3632 transitions. [2025-01-08 23:58:16,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3632 transitions. [2025-01-08 23:58:16,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2025-01-08 23:58:16,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:16,449 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 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-01-08 23:58:16,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:58:16,454 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:16,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1516533129, now seen corresponding path program 1 times [2025-01-08 23:58:16,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:16,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963581999] [2025-01-08 23:58:16,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:16,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:16,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 696 statements into 1 equivalence classes. [2025-01-08 23:58:16,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 696 of 696 statements. [2025-01-08 23:58:16,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:16,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1056 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2025-01-08 23:58:16,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:16,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963581999] [2025-01-08 23:58:16,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963581999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:16,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:16,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:58:16,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800702808] [2025-01-08 23:58:16,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:16,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:58:16,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:16,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:58:16,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:16,987 INFO L87 Difference]: Start difference. First operand 3386 states and 3632 transitions. Second operand has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:17,791 INFO L93 Difference]: Finished difference Result 6692 states and 7183 transitions. [2025-01-08 23:58:17,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:58:17,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 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 696 [2025-01-08 23:58:17,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:17,801 INFO L225 Difference]: With dead ends: 6692 [2025-01-08 23:58:17,804 INFO L226 Difference]: Without dead ends: 3386 [2025-01-08 23:58:17,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:17,807 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 63 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:17,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 26 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:58:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-01-08 23:58:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3386. [2025-01-08 23:58:17,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.0596750369276218) internal successors, (3587), 3385 states have internal predecessors, (3587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3587 transitions. [2025-01-08 23:58:17,840 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3587 transitions. Word has length 696 [2025-01-08 23:58:17,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:17,840 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3587 transitions. [2025-01-08 23:58:17,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:17,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3587 transitions. [2025-01-08 23:58:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2025-01-08 23:58:17,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:17,846 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:58:17,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:58:17,846 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:17,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:17,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2133239098, now seen corresponding path program 1 times [2025-01-08 23:58:17,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:17,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46719530] [2025-01-08 23:58:17,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:17,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:17,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 804 statements into 1 equivalence classes. [2025-01-08 23:58:17,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 804 of 804 statements. [2025-01-08 23:58:17,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:17,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:18,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 1384 proven. 155 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-01-08 23:58:18,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:18,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46719530] [2025-01-08 23:58:18,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46719530] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:18,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372302385] [2025-01-08 23:58:18,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:18,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:18,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:18,154 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:18,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:58:18,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 804 statements into 1 equivalence classes. [2025-01-08 23:58:18,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 804 of 804 statements. [2025-01-08 23:58:18,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:18,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:18,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:18,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2025-01-08 23:58:18,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:18,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372302385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:18,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:18,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 23:58:18,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573616417] [2025-01-08 23:58:18,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:18,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:18,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:18,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:18,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:58:18,435 INFO L87 Difference]: Start difference. First operand 3386 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:18,791 INFO L93 Difference]: Finished difference Result 6592 states and 6993 transitions. [2025-01-08 23:58:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:18,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 804 [2025-01-08 23:58:18,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:18,799 INFO L225 Difference]: With dead ends: 6592 [2025-01-08 23:58:18,799 INFO L226 Difference]: Without dead ends: 3386 [2025-01-08 23:58:18,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:58:18,804 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 124 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:18,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 193 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-01-08 23:58:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3386. [2025-01-08 23:58:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.058493353028065) internal successors, (3583), 3385 states have internal predecessors, (3583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3583 transitions. [2025-01-08 23:58:18,834 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3583 transitions. Word has length 804 [2025-01-08 23:58:18,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:18,835 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3583 transitions. [2025-01-08 23:58:18,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3583 transitions. [2025-01-08 23:58:18,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-01-08 23:58:18,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:18,841 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-01-08 23:58:18,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 23:58:19,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:19,046 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:19,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:19,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1548480527, now seen corresponding path program 1 times [2025-01-08 23:58:19,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:19,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051394038] [2025-01-08 23:58:19,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:19,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:19,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-01-08 23:58:19,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-01-08 23:58:19,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:19,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 1488 proven. 155 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-01-08 23:58:19,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051394038] [2025-01-08 23:58:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051394038] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782632764] [2025-01-08 23:58:19,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:19,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:19,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:19,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:19,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 23:58:19,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-01-08 23:58:19,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-01-08 23:58:19,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:19,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:19,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:19,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2025-01-08 23:58:19,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:19,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782632764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:19,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:19,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 23:58:19,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583993209] [2025-01-08 23:58:19,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:19,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:19,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:19,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:19,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:58:19,681 INFO L87 Difference]: Start difference. First operand 3386 states and 3583 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:20,032 INFO L93 Difference]: Finished difference Result 4634 states and 4878 transitions. [2025-01-08 23:58:20,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:20,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 829 [2025-01-08 23:58:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:20,042 INFO L225 Difference]: With dead ends: 4634 [2025-01-08 23:58:20,042 INFO L226 Difference]: Without dead ends: 4632 [2025-01-08 23:58:20,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 829 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:58:20,045 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:20,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 11 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-01-08 23:58:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 3386. [2025-01-08 23:58:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.058493353028065) internal successors, (3583), 3385 states have internal predecessors, (3583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3583 transitions. [2025-01-08 23:58:20,076 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3583 transitions. Word has length 829 [2025-01-08 23:58:20,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:20,077 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3583 transitions. [2025-01-08 23:58:20,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3583 transitions. [2025-01-08 23:58:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2025-01-08 23:58:20,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:20,083 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2025-01-08 23:58:20,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 23:58:20,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:20,288 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:20,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1879707780, now seen corresponding path program 1 times [2025-01-08 23:58:20,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:20,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664456222] [2025-01-08 23:58:20,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:20,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:20,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 863 statements into 1 equivalence classes. [2025-01-08 23:58:20,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 863 of 863 statements. [2025-01-08 23:58:20,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:20,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 1556 proven. 155 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-01-08 23:58:20,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:20,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664456222] [2025-01-08 23:58:20,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664456222] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:20,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858762380] [2025-01-08 23:58:20,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:20,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:20,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:20,634 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:20,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 23:58:20,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 863 statements into 1 equivalence classes. [2025-01-08 23:58:20,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 863 of 863 statements. [2025-01-08 23:58:20,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:20,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:20,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:20,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 1736 trivial. 0 not checked. [2025-01-08 23:58:20,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:20,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858762380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:20,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:20,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 23:58:20,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823367804] [2025-01-08 23:58:20,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:20,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:20,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:20,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:20,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:58:20,948 INFO L87 Difference]: Start difference. First operand 3386 states and 3583 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:21,280 INFO L93 Difference]: Finished difference Result 7302 states and 7725 transitions. [2025-01-08 23:58:21,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:21,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 863 [2025-01-08 23:58:21,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:21,281 INFO L225 Difference]: With dead ends: 7302 [2025-01-08 23:58:21,281 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:58:21,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 863 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:58:21,284 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 121 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:21,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 236 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:21,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:58:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:58:21,284 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-01-08 23:58:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:58:21,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 863 [2025-01-08 23:58:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:21,285 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:58:21,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:58:21,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:58:21,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:58:21,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 23:58:21,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-08 23:58:21,490 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:21,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:58:21,744 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:58:21,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:58:21 BoogieIcfgContainer [2025-01-08 23:58:21,755 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:58:21,756 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:58:21,756 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:58:21,756 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:58:21,756 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:58:05" (3/4) ... [2025-01-08 23:58:21,757 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:58:21,769 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:58:21,769 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:58:21,770 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:58:21,770 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:58:21,850 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:58:21,851 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:58:21,851 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:58:21,851 INFO L158 Benchmark]: Toolchain (without parser) took 18200.14ms. Allocated memory was 167.8MB in the beginning and 604.0MB in the end (delta: 436.2MB). Free memory was 120.3MB in the beginning and 354.5MB in the end (delta: -234.2MB). Peak memory consumption was 203.1MB. Max. memory is 16.1GB. [2025-01-08 23:58:21,851 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:58:21,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.39ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 87.9MB in the end (delta: 32.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 23:58:21,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.29ms. Allocated memory is still 167.8MB. Free memory was 87.9MB in the beginning and 78.6MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:58:21,852 INFO L158 Benchmark]: Boogie Preprocessor took 86.32ms. Allocated memory is still 167.8MB. Free memory was 78.6MB in the beginning and 66.7MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:58:21,852 INFO L158 Benchmark]: RCFGBuilder took 1101.05ms. Allocated memory is still 167.8MB. Free memory was 66.7MB in the beginning and 114.3MB in the end (delta: -47.6MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2025-01-08 23:58:21,852 INFO L158 Benchmark]: TraceAbstraction took 16507.52ms. Allocated memory was 167.8MB in the beginning and 604.0MB in the end (delta: 436.2MB). Free memory was 113.3MB in the beginning and 370.9MB in the end (delta: -257.7MB). Peak memory consumption was 179.1MB. Max. memory is 16.1GB. [2025-01-08 23:58:21,852 INFO L158 Benchmark]: Witness Printer took 95.04ms. Allocated memory is still 604.0MB. Free memory was 370.9MB in the beginning and 354.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:58:21,853 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.25ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.39ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 87.9MB in the end (delta: 32.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.29ms. Allocated memory is still 167.8MB. Free memory was 87.9MB in the beginning and 78.6MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.32ms. Allocated memory is still 167.8MB. Free memory was 78.6MB in the beginning and 66.7MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1101.05ms. Allocated memory is still 167.8MB. Free memory was 66.7MB in the beginning and 114.3MB in the end (delta: -47.6MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16507.52ms. Allocated memory was 167.8MB in the beginning and 604.0MB in the end (delta: 436.2MB). Free memory was 113.3MB in the beginning and 370.9MB in the end (delta: -257.7MB). Peak memory consumption was 179.1MB. Max. memory is 16.1GB. * Witness Printer took 95.04ms. Allocated memory is still 604.0MB. Free memory was 370.9MB in the beginning and 354.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. 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: 194]: 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, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2266 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2266 mSDsluCounter, 1879 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 1003 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9146 IncrementalHoareTripleChecker+Invalid, 10149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1003 mSolverCounterUnsat, 1771 mSDtfsCounter, 9146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3002 GetRequests, 2966 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3386occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 2498 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 9597 NumberOfCodeBlocks, 9597 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 9577 ConstructedInterpolants, 0 QuantifiedInterpolants, 23475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3630 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 18595/19210 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: 890]: Loop Invariant Derived loop invariant: ((((((7 <= a15) && (a24 == 1)) || ((a24 == 1) && (8 <= a21))) || ((a24 == 1) && (a21 <= 6))) || ((a24 == 1) && (a15 <= 5))) || (((a21 <= 6) && (((long long) 49 + a12) <= 0)) && (a15 <= 5))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:58:21,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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