./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label22.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/Problem10_label22.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 d1a3abd6c92a6d0d0dc43edf8f70faeb8d7cb6d143fe14753200dcbb4ae12846 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:39:38,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:39:38,498 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:39:38,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:39:38,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:39:38,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:39:38,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:39:38,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:39:38,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:39:38,529 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:39:38,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:39:38,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:39:38,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:39:38,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:39:38,530 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:39:38,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:39:38,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:39:38,530 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:39:38,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:39:38,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:39:38,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:39:38,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:39:38,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:39:38,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:39:38,531 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:39:38,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:39:38,531 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:39:38,531 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:39:38,531 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:39:38,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:39:38,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:39:38,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:39:38,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:39:38,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:39:38,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:39:38,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:39:38,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:39:38,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:39:38,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:39:38,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:39:38,533 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:39:38,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:39:38,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:39:38,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:39:38,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:39:38,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:39:38,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:39:38,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:39:38,533 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 -> d1a3abd6c92a6d0d0dc43edf8f70faeb8d7cb6d143fe14753200dcbb4ae12846 [2025-01-08 23:39:38,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:39:38,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:39:38,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:39:38,744 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:39:38,744 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:39:38,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label22.c [2025-01-08 23:39:39,844 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b92ef87d/c490324bd41c47c6bb9abb5cf1dd4f0c/FLAGe85db8bdc [2025-01-08 23:39:40,135 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:39:40,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label22.c [2025-01-08 23:39:40,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b92ef87d/c490324bd41c47c6bb9abb5cf1dd4f0c/FLAGe85db8bdc [2025-01-08 23:39:40,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b92ef87d/c490324bd41c47c6bb9abb5cf1dd4f0c [2025-01-08 23:39:40,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:39:40,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:39:40,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:39:40,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:39:40,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:39:40,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:39:40" (1/1) ... [2025-01-08 23:39:40,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8c171b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:40, skipping insertion in model container [2025-01-08 23:39:40,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:39:40" (1/1) ... [2025-01-08 23:39:40,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:39:40,303 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/Problem10_label22.c[4319,4332] [2025-01-08 23:39:40,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:39:40,387 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:39:40,399 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/Problem10_label22.c[4319,4332] [2025-01-08 23:39:40,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:39:40,467 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:39:40,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:40 WrapperNode [2025-01-08 23:39:40,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:39:40,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:39:40,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:39:40,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:39:40,473 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:39:40" (1/1) ... [2025-01-08 23:39:40,482 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:39:40" (1/1) ... [2025-01-08 23:39:40,520 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-01-08 23:39:40,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:39:40,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:39:40,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:39:40,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:39:40,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:40" (1/1) ... [2025-01-08 23:39:40,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:40" (1/1) ... [2025-01-08 23:39:40,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:40" (1/1) ... [2025-01-08 23:39:40,557 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:39:40,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:40" (1/1) ... [2025-01-08 23:39:40,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:40" (1/1) ... [2025-01-08 23:39:40,570 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:40" (1/1) ... [2025-01-08 23:39:40,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:40" (1/1) ... [2025-01-08 23:39:40,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:40" (1/1) ... [2025-01-08 23:39:40,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:40" (1/1) ... [2025-01-08 23:39:40,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:40" (1/1) ... [2025-01-08 23:39:40,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:39:40,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:39:40,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:39:40,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:39:40,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:40" (1/1) ... [2025-01-08 23:39:40,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:39:40,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:39:40,610 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:39:40,614 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:39:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:39:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:39:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:39:40,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:39:40,676 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:39:40,678 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:39:41,471 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-08 23:39:41,472 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:39:41,480 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:39:41,480 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:39:41,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:39:41 BoogieIcfgContainer [2025-01-08 23:39:41,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:39:41,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:39:41,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:39:41,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:39:41,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:39:40" (1/3) ... [2025-01-08 23:39:41,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a226da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:39:41, skipping insertion in model container [2025-01-08 23:39:41,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:40" (2/3) ... [2025-01-08 23:39:41,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a226da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:39:41, skipping insertion in model container [2025-01-08 23:39:41,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:39:41" (3/3) ... [2025-01-08 23:39:41,486 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label22.c [2025-01-08 23:39:41,495 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:39:41,496 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label22.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:39:41,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:39:41,552 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;@53c613a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:39:41,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:39:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 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:39:41,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-08 23:39:41,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:41,565 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] [2025-01-08 23:39:41,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:41,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:41,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1047782724, now seen corresponding path program 1 times [2025-01-08 23:39:41,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:41,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660698187] [2025-01-08 23:39:41,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:41,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:41,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-08 23:39:41,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-08 23:39:41,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:41,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:41,840 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:39:41,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:41,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660698187] [2025-01-08 23:39:41,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660698187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:41,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:41,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:39:41,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042935766] [2025-01-08 23:39:41,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:41,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:41,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:41,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:41,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:41,865 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 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 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:39:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:42,497 INFO L93 Difference]: Finished difference Result 567 states and 978 transitions. [2025-01-08 23:39:42,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:42,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-01-08 23:39:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:42,509 INFO L225 Difference]: With dead ends: 567 [2025-01-08 23:39:42,509 INFO L226 Difference]: Without dead ends: 282 [2025-01-08 23:39:42,516 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:39:42,519 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:42,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 66 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:39:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-08 23:39:42,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-01-08 23:39:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4661921708185053) internal successors, (412), 281 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:39:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 412 transitions. [2025-01-08 23:39:42,561 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 412 transitions. Word has length 37 [2025-01-08 23:39:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:42,561 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 412 transitions. [2025-01-08 23:39:42,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:39:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 412 transitions. [2025-01-08 23:39:42,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-08 23:39:42,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:42,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:42,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:39:42,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:42,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:42,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1928196511, now seen corresponding path program 1 times [2025-01-08 23:39:42,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:42,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692845705] [2025-01-08 23:39:42,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:42,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:42,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-08 23:39:42,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-08 23:39:42,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:42,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:42,778 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:42,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:42,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692845705] [2025-01-08 23:39:42,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692845705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:42,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:42,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:39:42,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879019301] [2025-01-08 23:39:42,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:42,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:42,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:42,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:42,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:42,780 INFO L87 Difference]: Start difference. First operand 282 states and 412 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:39:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:43,123 INFO L93 Difference]: Finished difference Result 840 states and 1231 transitions. [2025-01-08 23:39:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-01-08 23:39:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:43,127 INFO L225 Difference]: With dead ends: 840 [2025-01-08 23:39:43,127 INFO L226 Difference]: Without dead ends: 560 [2025-01-08 23:39:43,128 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:39:43,128 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 76 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:43,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 66 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:39:43,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-01-08 23:39:43,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-01-08 23:39:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3076923076923077) internal successors, (731), 559 states have internal predecessors, (731), 0 states have call successors, (0), 0 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:39:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 731 transitions. [2025-01-08 23:39:43,145 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 731 transitions. Word has length 107 [2025-01-08 23:39:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:43,145 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 731 transitions. [2025-01-08 23:39:43,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:39:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 731 transitions. [2025-01-08 23:39:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-08 23:39:43,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:43,147 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:43,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:39:43,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:43,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:43,148 INFO L85 PathProgramCache]: Analyzing trace with hash -401307376, now seen corresponding path program 1 times [2025-01-08 23:39:43,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:43,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023694638] [2025-01-08 23:39:43,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:43,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:43,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-08 23:39:43,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-08 23:39:43,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:43,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:43,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:43,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023694638] [2025-01-08 23:39:43,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023694638] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:39:43,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193340583] [2025-01-08 23:39:43,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:43,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:39:43,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:39:43,377 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:39:43,379 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:39:43,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-08 23:39:43,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-08 23:39:43,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:43,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:43,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:39:43,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:39:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:43,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:39:43,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193340583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:43,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:39:43,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:39:43,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299542412] [2025-01-08 23:39:43,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:43,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:43,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:43,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:43,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:39:43,503 INFO L87 Difference]: Start difference. First operand 560 states and 731 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:39:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:43,876 INFO L93 Difference]: Finished difference Result 979 states and 1300 transitions. [2025-01-08 23:39:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:43,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-01-08 23:39:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:43,880 INFO L225 Difference]: With dead ends: 979 [2025-01-08 23:39:43,880 INFO L226 Difference]: Without dead ends: 977 [2025-01-08 23:39:43,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:39:43,881 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 147 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:43,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 11 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:39:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-08 23:39:43,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 699. [2025-01-08 23:39:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.3524355300859598) internal successors, (944), 698 states have internal predecessors, (944), 0 states have call successors, (0), 0 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:39:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 944 transitions. [2025-01-08 23:39:43,895 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 944 transitions. Word has length 112 [2025-01-08 23:39:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:43,896 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 944 transitions. [2025-01-08 23:39:43,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:39:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 944 transitions. [2025-01-08 23:39:43,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-08 23:39:43,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:43,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:43,904 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:39:44,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:39:44,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:44,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash -975138343, now seen corresponding path program 1 times [2025-01-08 23:39:44,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:44,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561668071] [2025-01-08 23:39:44,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:44,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:44,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-08 23:39:44,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-08 23:39:44,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:44,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:44,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:44,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561668071] [2025-01-08 23:39:44,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561668071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:44,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:44,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:39:44,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254277351] [2025-01-08 23:39:44,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:44,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:44,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:44,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:44,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:44,264 INFO L87 Difference]: Start difference. First operand 699 states and 944 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:44,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:44,680 INFO L93 Difference]: Finished difference Result 1952 states and 2612 transitions. [2025-01-08 23:39:44,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:44,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-01-08 23:39:44,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:44,685 INFO L225 Difference]: With dead ends: 1952 [2025-01-08 23:39:44,685 INFO L226 Difference]: Without dead ends: 1255 [2025-01-08 23:39:44,686 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:39:44,687 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 60 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:44,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 34 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:39:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-01-08 23:39:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1116. [2025-01-08 23:39:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.2878923766816144) internal successors, (1436), 1115 states have internal predecessors, (1436), 0 states have call successors, (0), 0 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:39:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1436 transitions. [2025-01-08 23:39:44,710 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1436 transitions. Word has length 155 [2025-01-08 23:39:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:44,711 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1436 transitions. [2025-01-08 23:39:44,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1436 transitions. [2025-01-08 23:39:44,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-08 23:39:44,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:44,714 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:39:44,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:39:44,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:44,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:44,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1252826561, now seen corresponding path program 1 times [2025-01-08 23:39:44,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:44,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386690897] [2025-01-08 23:39:44,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:44,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:44,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-08 23:39:44,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-08 23:39:44,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:44,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:45,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:45,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386690897] [2025-01-08 23:39:45,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386690897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:45,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:45,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:39:45,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943626294] [2025-01-08 23:39:45,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:45,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:39:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:45,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:39:45,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:39:45,080 INFO L87 Difference]: Start difference. First operand 1116 states and 1436 transitions. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 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:39:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:45,588 INFO L93 Difference]: Finished difference Result 2285 states and 2925 transitions. [2025-01-08 23:39:45,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:39:45,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 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 190 [2025-01-08 23:39:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:45,592 INFO L225 Difference]: With dead ends: 2285 [2025-01-08 23:39:45,592 INFO L226 Difference]: Without dead ends: 1116 [2025-01-08 23:39:45,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:39:45,594 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:45,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 30 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:39:45,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-01-08 23:39:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2025-01-08 23:39:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.2807174887892376) internal successors, (1428), 1115 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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:39:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1428 transitions. [2025-01-08 23:39:45,611 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1428 transitions. Word has length 190 [2025-01-08 23:39:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:45,611 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1428 transitions. [2025-01-08 23:39:45,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 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:39:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1428 transitions. [2025-01-08 23:39:45,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-08 23:39:45,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:45,615 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:45,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:39:45,615 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:45,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:45,616 INFO L85 PathProgramCache]: Analyzing trace with hash 290399664, now seen corresponding path program 1 times [2025-01-08 23:39:45,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:45,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980359115] [2025-01-08 23:39:45,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:45,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:45,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-08 23:39:45,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-08 23:39:45,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:45,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:45,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:45,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980359115] [2025-01-08 23:39:45,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980359115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:45,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:45,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:39:45,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091217464] [2025-01-08 23:39:45,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:45,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:45,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:45,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:45,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:45,767 INFO L87 Difference]: Start difference. First operand 1116 states and 1428 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:46,127 INFO L93 Difference]: Finished difference Result 2647 states and 3409 transitions. [2025-01-08 23:39:46,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:46,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2025-01-08 23:39:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:46,133 INFO L225 Difference]: With dead ends: 2647 [2025-01-08 23:39:46,133 INFO L226 Difference]: Without dead ends: 1533 [2025-01-08 23:39:46,134 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:39:46,135 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:46,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 214 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:39:46,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2025-01-08 23:39:46,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1116. [2025-01-08 23:39:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.272645739910314) internal successors, (1419), 1115 states have internal predecessors, (1419), 0 states have call successors, (0), 0 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:39:46,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1419 transitions. [2025-01-08 23:39:46,154 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1419 transitions. Word has length 197 [2025-01-08 23:39:46,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:46,155 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1419 transitions. [2025-01-08 23:39:46,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1419 transitions. [2025-01-08 23:39:46,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-08 23:39:46,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:46,157 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:39:46,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:39:46,157 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:46,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:46,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1179309225, now seen corresponding path program 1 times [2025-01-08 23:39:46,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:46,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545943199] [2025-01-08 23:39:46,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:46,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:46,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-08 23:39:46,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-08 23:39:46,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:46,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-08 23:39:46,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:46,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545943199] [2025-01-08 23:39:46,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545943199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:46,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:46,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:39:46,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571373924] [2025-01-08 23:39:46,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:46,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:46,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:46,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:46,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:46,346 INFO L87 Difference]: Start difference. First operand 1116 states and 1419 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 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:39:46,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:46,652 INFO L93 Difference]: Finished difference Result 2369 states and 2984 transitions. [2025-01-08 23:39:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:46,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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 207 [2025-01-08 23:39:46,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:46,656 INFO L225 Difference]: With dead ends: 2369 [2025-01-08 23:39:46,656 INFO L226 Difference]: Without dead ends: 1255 [2025-01-08 23:39:46,657 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:39:46,658 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 49 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:46,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 82 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:39:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-01-08 23:39:46,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-01-08 23:39:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.2456140350877194) internal successors, (1562), 1254 states have internal predecessors, (1562), 0 states have call successors, (0), 0 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:39:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1562 transitions. [2025-01-08 23:39:46,676 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1562 transitions. Word has length 207 [2025-01-08 23:39:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:46,676 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1562 transitions. [2025-01-08 23:39:46,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 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:39:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1562 transitions. [2025-01-08 23:39:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-08 23:39:46,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:46,679 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:46,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:39:46,679 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:46,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:46,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1724340325, now seen corresponding path program 1 times [2025-01-08 23:39:46,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:46,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628247951] [2025-01-08 23:39:46,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:46,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:46,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-08 23:39:46,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-08 23:39:46,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:46,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:46,817 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:46,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:46,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628247951] [2025-01-08 23:39:46,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628247951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:46,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:46,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:39:46,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860558759] [2025-01-08 23:39:46,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:46,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:46,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:46,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:46,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:46,819 INFO L87 Difference]: Start difference. First operand 1255 states and 1562 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 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:39:47,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:47,169 INFO L93 Difference]: Finished difference Result 2786 states and 3534 transitions. [2025-01-08 23:39:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:47,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2025-01-08 23:39:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:47,174 INFO L225 Difference]: With dead ends: 2786 [2025-01-08 23:39:47,174 INFO L226 Difference]: Without dead ends: 1672 [2025-01-08 23:39:47,175 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:39:47,176 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 75 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:47,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 190 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:39:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-01-08 23:39:47,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1533. [2025-01-08 23:39:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.1697127937336815) internal successors, (1792), 1532 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1792 transitions. [2025-01-08 23:39:47,198 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1792 transitions. Word has length 226 [2025-01-08 23:39:47,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:47,198 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 1792 transitions. [2025-01-08 23:39:47,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 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:39:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1792 transitions. [2025-01-08 23:39:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-08 23:39:47,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:47,202 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:47,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:39:47,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:47,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:47,203 INFO L85 PathProgramCache]: Analyzing trace with hash 643784691, now seen corresponding path program 1 times [2025-01-08 23:39:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:47,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534488325] [2025-01-08 23:39:47,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:47,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:47,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-08 23:39:47,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-08 23:39:47,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:47,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 86 proven. 18 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-01-08 23:39:47,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:47,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534488325] [2025-01-08 23:39:47,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534488325] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:39:47,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453073808] [2025-01-08 23:39:47,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:47,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:39:47,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:39:47,468 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:39:47,469 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:39:47,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-08 23:39:47,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-08 23:39:47,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:47,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:47,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:39:47,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:39:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-01-08 23:39:47,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:39:47,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453073808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:47,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:39:47,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:39:47,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859787217] [2025-01-08 23:39:47,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:47,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:47,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:47,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:47,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:39:47,638 INFO L87 Difference]: Start difference. First operand 1533 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:47,973 INFO L93 Difference]: Finished difference Result 3201 states and 3764 transitions. [2025-01-08 23:39:47,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:47,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 336 [2025-01-08 23:39:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:47,974 INFO L225 Difference]: With dead ends: 3201 [2025-01-08 23:39:47,974 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:39:47,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:39:47,977 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 105 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:47,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 222 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:39:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:39:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:39:47,978 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:39:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:39:47,978 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 336 [2025-01-08 23:39:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:47,978 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:39:47,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:39:47,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:39:47,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:39:47,987 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:39:48,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:39:48,187 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:48,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:39:48,328 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:39:48,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:39:48 BoogieIcfgContainer [2025-01-08 23:39:48,339 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:39:48,339 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:39:48,339 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:39:48,339 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:39:48,340 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:39:41" (3/4) ... [2025-01-08 23:39:48,341 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:39:48,356 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:39:48,358 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:39:48,358 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:39:48,358 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:39:48,452 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:39:48,453 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:39:48,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:39:48,454 INFO L158 Benchmark]: Toolchain (without parser) took 8288.08ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 122.1MB in the beginning and 271.5MB in the end (delta: -149.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2025-01-08 23:39:48,454 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:39:48,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.72ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 95.0MB in the end (delta: 27.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:39:48,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.31ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 87.9MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:39:48,454 INFO L158 Benchmark]: Boogie Preprocessor took 65.66ms. Allocated memory is still 167.8MB. Free memory was 87.9MB in the beginning and 78.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:39:48,455 INFO L158 Benchmark]: RCFGBuilder took 893.74ms. Allocated memory is still 167.8MB. Free memory was 78.1MB in the beginning and 70.9MB in the end (delta: 7.3MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2025-01-08 23:39:48,455 INFO L158 Benchmark]: TraceAbstraction took 6857.14ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 70.1MB in the beginning and 283.8MB in the end (delta: -213.6MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. [2025-01-08 23:39:48,455 INFO L158 Benchmark]: Witness Printer took 113.45ms. Allocated memory is still 335.5MB. Free memory was 283.8MB in the beginning and 271.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:39:48,457 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.15ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.72ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 95.0MB in the end (delta: 27.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.31ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 87.9MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.66ms. Allocated memory is still 167.8MB. Free memory was 87.9MB in the beginning and 78.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 893.74ms. Allocated memory is still 167.8MB. Free memory was 78.1MB in the beginning and 70.9MB in the end (delta: 7.3MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6857.14ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 70.1MB in the beginning and 283.8MB in the end (delta: -213.6MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. * Witness Printer took 113.45ms. Allocated memory is still 335.5MB. Free memory was 283.8MB in the beginning and 271.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. 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: 125]: 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 845 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 845 mSDsluCounter, 915 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 545 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3852 IncrementalHoareTripleChecker+Invalid, 4397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 545 mSolverCounterUnsat, 859 mSDtfsCounter, 3852 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1533occurred in iteration=8, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 973 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2015 NumberOfCodeBlocks, 2015 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2004 ConstructedInterpolants, 0 QuantifiedInterpolants, 7310 SizeOfPredicates, 0 NumberOfNonLiveVariables, 652 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 1389/1423 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: 592]: Loop Invariant Derived loop invariant: (((((((((a10 <= 0) && (8 <= a19)) && (14 == a4)) && (a12 == 0)) || ((((a19 <= 9) && (a1 <= 23)) && (14 == a4)) && (a12 == 0))) || (((a19 <= 6) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (8 <= a19)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:39:48,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE