./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label17.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/Problem02_label17.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 d3602c5801c05a09989d37521ec0a56c80d33e64222732bb3b7051e65443f9ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:53:45,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:53:45,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:53:45,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:53:45,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:53:45,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:53:45,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:53:45,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:53:45,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:53:45,813 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:53:45,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:53:45,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:53:45,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:53:45,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:53:45,814 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:53:45,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:53:45,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:53:45,814 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:53:45,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:53:45,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:53:45,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:53:45,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:53:45,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:53:45,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:53:45,814 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:53:45,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:53:45,814 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:53:45,814 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:53:45,815 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:45,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:45,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:53:45,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:53:45,815 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 -> d3602c5801c05a09989d37521ec0a56c80d33e64222732bb3b7051e65443f9ad [2025-01-08 22:53:46,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:53:46,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:53:46,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:53:46,090 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:53:46,090 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:53:46,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label17.c [2025-01-08 22:53:47,324 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d2f798f9/e06d61e9cd714ba68df51c98c960580c/FLAG52a7d8edb [2025-01-08 22:53:47,623 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:53:47,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label17.c [2025-01-08 22:53:47,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d2f798f9/e06d61e9cd714ba68df51c98c960580c/FLAG52a7d8edb [2025-01-08 22:53:47,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d2f798f9/e06d61e9cd714ba68df51c98c960580c [2025-01-08 22:53:47,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:53:47,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:53:47,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:53:47,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:53:47,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:53:47,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:53:47" (1/1) ... [2025-01-08 22:53:47,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b59d556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:47, skipping insertion in model container [2025-01-08 22:53:47,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:53:47" (1/1) ... [2025-01-08 22:53:47,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:53:48,155 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/Problem02_label17.c[18943,18956] [2025-01-08 22:53:48,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:53:48,179 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:53:48,231 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/Problem02_label17.c[18943,18956] [2025-01-08 22:53:48,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:53:48,254 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:53:48,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48 WrapperNode [2025-01-08 22:53:48,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:53:48,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:53:48,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:53:48,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:53:48,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,310 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-01-08 22:53:48,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:53:48,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:53:48,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:53:48,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:53:48,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,337 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 22:53:48,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,347 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,349 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:53:48,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:53:48,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:53:48,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:53:48,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:48,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:53:48,402 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 22:53:48,405 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 22:53:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:53:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:53:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:53:48,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:53:48,478 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:53:48,479 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:53:49,262 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-08 22:53:49,262 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:53:49,271 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:53:49,271 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:53:49,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:53:49 BoogieIcfgContainer [2025-01-08 22:53:49,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:53:49,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:53:49,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:53:49,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:53:49,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:53:47" (1/3) ... [2025-01-08 22:53:49,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce81cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:53:49, skipping insertion in model container [2025-01-08 22:53:49,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (2/3) ... [2025-01-08 22:53:49,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce81cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:53:49, skipping insertion in model container [2025-01-08 22:53:49,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:53:49" (3/3) ... [2025-01-08 22:53:49,278 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label17.c [2025-01-08 22:53:49,288 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:53:49,290 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label17.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:53:49,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:53:49,353 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;@74eef97e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:53:49,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:53:49,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 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 22:53:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-08 22:53:49,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:49,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:53:49,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:49,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:49,371 INFO L85 PathProgramCache]: Analyzing trace with hash 672362174, now seen corresponding path program 1 times [2025-01-08 22:53:49,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:49,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936092094] [2025-01-08 22:53:49,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:49,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:49,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-08 22:53:49,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-08 22:53:49,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:49,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:49,792 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 22:53:49,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:49,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936092094] [2025-01-08 22:53:49,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936092094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:49,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:49,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:49,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741252580] [2025-01-08 22:53:49,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:49,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:49,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:49,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:49,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:49,819 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 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 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 22:53:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:50,367 INFO L93 Difference]: Finished difference Result 601 states and 1032 transitions. [2025-01-08 22:53:50,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:50,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-01-08 22:53:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:50,375 INFO L225 Difference]: With dead ends: 601 [2025-01-08 22:53:50,376 INFO L226 Difference]: Without dead ends: 310 [2025-01-08 22:53:50,378 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 22:53:50,380 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 115 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:50,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 117 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:53:50,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-01-08 22:53:50,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2025-01-08 22:53:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4368932038834952) internal successors, (444), 309 states have internal predecessors, (444), 0 states have call successors, (0), 0 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 22:53:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions. [2025-01-08 22:53:50,416 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 119 [2025-01-08 22:53:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:50,417 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 444 transitions. [2025-01-08 22:53:50,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 22:53:50,418 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions. [2025-01-08 22:53:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-08 22:53:50,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:50,424 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:50,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:53:50,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:50,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash 909816125, now seen corresponding path program 1 times [2025-01-08 22:53:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:50,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092464337] [2025-01-08 22:53:50,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:50,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:50,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-08 22:53:50,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-08 22:53:50,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:50,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:50,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:50,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092464337] [2025-01-08 22:53:50,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092464337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:50,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:50,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:50,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069676784] [2025-01-08 22:53:50,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:50,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:50,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:50,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:50,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:50,640 INFO L87 Difference]: Start difference. First operand 310 states and 444 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 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 22:53:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:51,033 INFO L93 Difference]: Finished difference Result 902 states and 1298 transitions. [2025-01-08 22:53:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:51,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-01-08 22:53:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:51,035 INFO L225 Difference]: With dead ends: 902 [2025-01-08 22:53:51,036 INFO L226 Difference]: Without dead ends: 594 [2025-01-08 22:53:51,036 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 22:53:51,037 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 130 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:51,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 123 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:53:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-01-08 22:53:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2025-01-08 22:53:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 1.2707275803722504) internal successors, (751), 591 states have internal predecessors, (751), 0 states have call successors, (0), 0 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 22:53:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 751 transitions. [2025-01-08 22:53:51,060 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 751 transitions. Word has length 137 [2025-01-08 22:53:51,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:51,060 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 751 transitions. [2025-01-08 22:53:51,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 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 22:53:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 751 transitions. [2025-01-08 22:53:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-08 22:53:51,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:51,063 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:51,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:53:51,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:51,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:51,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1201706366, now seen corresponding path program 1 times [2025-01-08 22:53:51,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:51,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975130741] [2025-01-08 22:53:51,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:51,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:51,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-08 22:53:51,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-08 22:53:51,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:51,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:51,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:51,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975130741] [2025-01-08 22:53:51,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975130741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:51,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:51,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:51,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941660504] [2025-01-08 22:53:51,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:51,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:51,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:51,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:51,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:51,180 INFO L87 Difference]: Start difference. First operand 592 states and 751 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 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 22:53:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:51,367 INFO L93 Difference]: Finished difference Result 1172 states and 1487 transitions. [2025-01-08 22:53:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:51,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-01-08 22:53:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:51,370 INFO L225 Difference]: With dead ends: 1172 [2025-01-08 22:53:51,370 INFO L226 Difference]: Without dead ends: 582 [2025-01-08 22:53:51,371 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 22:53:51,371 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 195 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:51,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 23 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:53:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-01-08 22:53:51,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2025-01-08 22:53:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.2013769363166953) internal successors, (698), 581 states have internal predecessors, (698), 0 states have call successors, (0), 0 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 22:53:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 698 transitions. [2025-01-08 22:53:51,386 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 698 transitions. Word has length 138 [2025-01-08 22:53:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:51,386 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 698 transitions. [2025-01-08 22:53:51,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 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 22:53:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 698 transitions. [2025-01-08 22:53:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-08 22:53:51,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:51,389 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:53:51,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:53:51,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:51,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:51,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1424112393, now seen corresponding path program 1 times [2025-01-08 22:53:51,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:51,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537368740] [2025-01-08 22:53:51,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:51,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:51,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-08 22:53:51,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-08 22:53:51,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:51,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:51,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:51,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537368740] [2025-01-08 22:53:51,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537368740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:51,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:51,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:53:51,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561047570] [2025-01-08 22:53:51,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:51,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:53:51,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:51,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:53:51,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:53:51,639 INFO L87 Difference]: Start difference. First operand 582 states and 698 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 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 22:53:52,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:52,289 INFO L93 Difference]: Finished difference Result 1582 states and 1889 transitions. [2025-01-08 22:53:52,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:53:52,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-01-08 22:53:52,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:52,292 INFO L225 Difference]: With dead ends: 1582 [2025-01-08 22:53:52,292 INFO L226 Difference]: Without dead ends: 862 [2025-01-08 22:53:52,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:53:52,294 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 372 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:52,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 105 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:53:52,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-01-08 22:53:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 582. [2025-01-08 22:53:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.1549053356282273) internal successors, (671), 581 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 671 transitions. [2025-01-08 22:53:52,307 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 671 transitions. Word has length 142 [2025-01-08 22:53:52,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:52,307 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 671 transitions. [2025-01-08 22:53:52,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 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 22:53:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 671 transitions. [2025-01-08 22:53:52,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-08 22:53:52,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:52,309 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:52,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:53:52,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:52,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:52,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1294395647, now seen corresponding path program 1 times [2025-01-08 22:53:52,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:52,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220920795] [2025-01-08 22:53:52,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:52,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-08 22:53:52,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-08 22:53:52,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:52,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:53:52,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:52,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220920795] [2025-01-08 22:53:52,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220920795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:52,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:52,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:52,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951942607] [2025-01-08 22:53:52,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:52,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:52,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:52,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:52,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:52,485 INFO L87 Difference]: Start difference. First operand 582 states and 671 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 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 22:53:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:52,783 INFO L93 Difference]: Finished difference Result 1586 states and 1843 transitions. [2025-01-08 22:53:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:52,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 146 [2025-01-08 22:53:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:52,786 INFO L225 Difference]: With dead ends: 1586 [2025-01-08 22:53:52,786 INFO L226 Difference]: Without dead ends: 865 [2025-01-08 22:53:52,787 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 22:53:52,787 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 35 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:52,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 194 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-01-08 22:53:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 861. [2025-01-08 22:53:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 1.1290697674418604) internal successors, (971), 860 states have internal predecessors, (971), 0 states have call successors, (0), 0 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 22:53:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 971 transitions. [2025-01-08 22:53:52,799 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 971 transitions. Word has length 146 [2025-01-08 22:53:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:52,799 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 971 transitions. [2025-01-08 22:53:52,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 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 22:53:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 971 transitions. [2025-01-08 22:53:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-08 22:53:52,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:52,801 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:53:52,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:53:52,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:52,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:52,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1431812164, now seen corresponding path program 1 times [2025-01-08 22:53:52,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:52,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093523603] [2025-01-08 22:53:52,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:52,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:52,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-08 22:53:52,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-08 22:53:52,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:52,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:52,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:52,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093523603] [2025-01-08 22:53:52,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093523603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:52,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:52,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:53:52,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862469704] [2025-01-08 22:53:52,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:52,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:53:52,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:52,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:53:52,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:53:52,985 INFO L87 Difference]: Start difference. First operand 861 states and 971 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 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 22:53:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:53,545 INFO L93 Difference]: Finished difference Result 1860 states and 2108 transitions. [2025-01-08 22:53:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:53:53,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-01-08 22:53:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:53,548 INFO L225 Difference]: With dead ends: 1860 [2025-01-08 22:53:53,548 INFO L226 Difference]: Without dead ends: 1141 [2025-01-08 22:53:53,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:53:53,549 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 313 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:53,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 118 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:53:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-01-08 22:53:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1001. [2025-01-08 22:53:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 1000 states have (on average 1.114) internal successors, (1114), 1000 states have internal predecessors, (1114), 0 states have call successors, (0), 0 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 22:53:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1114 transitions. [2025-01-08 22:53:53,562 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1114 transitions. Word has length 160 [2025-01-08 22:53:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:53,562 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1114 transitions. [2025-01-08 22:53:53,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 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 22:53:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1114 transitions. [2025-01-08 22:53:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-08 22:53:53,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:53,564 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:53,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:53:53,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:53,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1091137808, now seen corresponding path program 1 times [2025-01-08 22:53:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:53,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671919234] [2025-01-08 22:53:53,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:53,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:53,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-08 22:53:53,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-08 22:53:53,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:53,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:53:53,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:53,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671919234] [2025-01-08 22:53:53,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671919234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:53,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:53,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:53,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318700968] [2025-01-08 22:53:53,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:53,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:53,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:53,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:53,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:53,670 INFO L87 Difference]: Start difference. First operand 1001 states and 1114 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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 22:53:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:54,098 INFO L93 Difference]: Finished difference Result 2420 states and 2721 transitions. [2025-01-08 22:53:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:54,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 163 [2025-01-08 22:53:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:54,105 INFO L225 Difference]: With dead ends: 2420 [2025-01-08 22:53:54,105 INFO L226 Difference]: Without dead ends: 859 [2025-01-08 22:53:54,106 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 22:53:54,107 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 130 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:54,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 222 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:53:54,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-01-08 22:53:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2025-01-08 22:53:54,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.064102564102564) internal successors, (913), 858 states have internal predecessors, (913), 0 states have call successors, (0), 0 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 22:53:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 913 transitions. [2025-01-08 22:53:54,133 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 913 transitions. Word has length 163 [2025-01-08 22:53:54,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:54,133 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 913 transitions. [2025-01-08 22:53:54,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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 22:53:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 913 transitions. [2025-01-08 22:53:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-08 22:53:54,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:54,139 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:54,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:53:54,139 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:54,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:54,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2115789475, now seen corresponding path program 1 times [2025-01-08 22:53:54,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:54,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300054409] [2025-01-08 22:53:54,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:54,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:54,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-08 22:53:54,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-08 22:53:54,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:54,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:54,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:54,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300054409] [2025-01-08 22:53:54,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300054409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:54,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:54,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:54,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030760833] [2025-01-08 22:53:54,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:54,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:54,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:54,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:54,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:54,305 INFO L87 Difference]: Start difference. First operand 859 states and 913 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 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 22:53:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:54,722 INFO L93 Difference]: Finished difference Result 2138 states and 2288 transitions. [2025-01-08 22:53:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:54,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2025-01-08 22:53:54,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:54,729 INFO L225 Difference]: With dead ends: 2138 [2025-01-08 22:53:54,732 INFO L226 Difference]: Without dead ends: 1421 [2025-01-08 22:53:54,733 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 22:53:54,734 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 130 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:54,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 178 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:53:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2025-01-08 22:53:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1280. [2025-01-08 22:53:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.0648944487881158) internal successors, (1362), 1279 states have internal predecessors, (1362), 0 states have call successors, (0), 0 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 22:53:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1362 transitions. [2025-01-08 22:53:54,769 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1362 transitions. Word has length 181 [2025-01-08 22:53:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:54,769 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1362 transitions. [2025-01-08 22:53:54,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 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 22:53:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1362 transitions. [2025-01-08 22:53:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-08 22:53:54,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:54,775 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, 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] [2025-01-08 22:53:54,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:53:54,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:54,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:54,776 INFO L85 PathProgramCache]: Analyzing trace with hash 303701369, now seen corresponding path program 1 times [2025-01-08 22:53:54,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:54,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819798163] [2025-01-08 22:53:54,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:54,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:54,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-08 22:53:54,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-08 22:53:54,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:54,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-08 22:53:54,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:54,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819798163] [2025-01-08 22:53:54,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819798163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:54,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:54,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469917588] [2025-01-08 22:53:54,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:54,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:54,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:54,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:54,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:54,914 INFO L87 Difference]: Start difference. First operand 1280 states and 1362 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 22:53:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:55,140 INFO L93 Difference]: Finished difference Result 2557 states and 2719 transitions. [2025-01-08 22:53:55,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:55,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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 204 [2025-01-08 22:53:55,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:55,144 INFO L225 Difference]: With dead ends: 2557 [2025-01-08 22:53:55,144 INFO L226 Difference]: Without dead ends: 1277 [2025-01-08 22:53:55,145 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 22:53:55,146 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 57 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:55,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 26 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:53:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2025-01-08 22:53:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1277. [2025-01-08 22:53:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1276 states have (on average 1.061128526645768) internal successors, (1354), 1276 states have internal predecessors, (1354), 0 states have call successors, (0), 0 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 22:53:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1354 transitions. [2025-01-08 22:53:55,162 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1354 transitions. Word has length 204 [2025-01-08 22:53:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:55,163 INFO L471 AbstractCegarLoop]: Abstraction has 1277 states and 1354 transitions. [2025-01-08 22:53:55,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 22:53:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1354 transitions. [2025-01-08 22:53:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-08 22:53:55,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:55,165 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:53:55,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:53:55,165 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:55,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash -334667053, now seen corresponding path program 1 times [2025-01-08 22:53:55,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:55,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072137078] [2025-01-08 22:53:55,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:55,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:55,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-08 22:53:55,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-08 22:53:55,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:55,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-08 22:53:55,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:55,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072137078] [2025-01-08 22:53:55,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072137078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:55,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:55,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975973889] [2025-01-08 22:53:55,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:55,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:53:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:55,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:53:55,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:53:55,412 INFO L87 Difference]: Start difference. First operand 1277 states and 1354 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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 22:53:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:55,662 INFO L93 Difference]: Finished difference Result 1503 states and 1580 transitions. [2025-01-08 22:53:55,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:53:55,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 217 [2025-01-08 22:53:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:55,666 INFO L225 Difference]: With dead ends: 1503 [2025-01-08 22:53:55,666 INFO L226 Difference]: Without dead ends: 1277 [2025-01-08 22:53:55,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:53:55,667 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 108 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:55,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 33 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:53:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2025-01-08 22:53:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1277. [2025-01-08 22:53:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1276 states have (on average 1.0564263322884013) internal successors, (1348), 1276 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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 22:53:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1348 transitions. [2025-01-08 22:53:55,683 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1348 transitions. Word has length 217 [2025-01-08 22:53:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:55,683 INFO L471 AbstractCegarLoop]: Abstraction has 1277 states and 1348 transitions. [2025-01-08 22:53:55,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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 22:53:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1348 transitions. [2025-01-08 22:53:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-08 22:53:55,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:55,686 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:55,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:53:55,686 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:55,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:55,687 INFO L85 PathProgramCache]: Analyzing trace with hash 668487628, now seen corresponding path program 1 times [2025-01-08 22:53:55,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:55,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587698876] [2025-01-08 22:53:55,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:55,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:55,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-08 22:53:55,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-08 22:53:55,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:55,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-08 22:53:55,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:55,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587698876] [2025-01-08 22:53:55,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587698876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:55,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:55,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:55,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112588634] [2025-01-08 22:53:55,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:55,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:55,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:55,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:55,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:55,808 INFO L87 Difference]: Start difference. First operand 1277 states and 1348 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 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 22:53:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:56,049 INFO L93 Difference]: Finished difference Result 2692 states and 2853 transitions. [2025-01-08 22:53:56,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:56,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 230 [2025-01-08 22:53:56,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:56,053 INFO L225 Difference]: With dead ends: 2692 [2025-01-08 22:53:56,053 INFO L226 Difference]: Without dead ends: 1414 [2025-01-08 22:53:56,054 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 22:53:56,055 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 124 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:56,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 186 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:53:56,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-01-08 22:53:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2025-01-08 22:53:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 1.0509554140127388) internal successors, (1485), 1413 states have internal predecessors, (1485), 0 states have call successors, (0), 0 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 22:53:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 1485 transitions. [2025-01-08 22:53:56,073 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 1485 transitions. Word has length 230 [2025-01-08 22:53:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:56,073 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 1485 transitions. [2025-01-08 22:53:56,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 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 22:53:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1485 transitions. [2025-01-08 22:53:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-01-08 22:53:56,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:56,077 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2025-01-08 22:53:56,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:53:56,077 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:56,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:56,077 INFO L85 PathProgramCache]: Analyzing trace with hash -619586935, now seen corresponding path program 1 times [2025-01-08 22:53:56,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:56,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615350353] [2025-01-08 22:53:56,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:56,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:56,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-01-08 22:53:56,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-08 22:53:56,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:56,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 22:53:56,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:56,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615350353] [2025-01-08 22:53:56,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615350353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:56,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:56,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:56,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215543254] [2025-01-08 22:53:56,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:56,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:56,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:56,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:56,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:56,192 INFO L87 Difference]: Start difference. First operand 1414 states and 1485 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 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 22:53:56,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:56,428 INFO L93 Difference]: Finished difference Result 2404 states and 2529 transitions. [2025-01-08 22:53:56,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:56,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 282 [2025-01-08 22:53:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:56,429 INFO L225 Difference]: With dead ends: 2404 [2025-01-08 22:53:56,429 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:53:56,430 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 22:53:56,431 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:56,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 31 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:53:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:53:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:53:56,432 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 22:53:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:53:56,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 282 [2025-01-08 22:53:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:56,432 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:53:56,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 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 22:53:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:53:56,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:53:56,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:53:56,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:53:56,437 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:56,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:53:56,691 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:53:56,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:53:56 BoogieIcfgContainer [2025-01-08 22:53:56,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:53:56,711 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:53:56,711 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:53:56,711 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:53:56,712 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:53:49" (3/4) ... [2025-01-08 22:53:56,714 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:53:56,730 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 22:53:56,730 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:53:56,731 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:53:56,731 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:53:56,842 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:53:56,843 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:53:56,843 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:53:56,844 INFO L158 Benchmark]: Toolchain (without parser) took 8907.86ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 123.3MB in the beginning and 377.3MB in the end (delta: -254.0MB). Peak memory consumption was 195.7MB. Max. memory is 16.1GB. [2025-01-08 22:53:56,844 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:53:56,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.46ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 96.4MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:53:56,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.10ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 91.4MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:53:56,845 INFO L158 Benchmark]: Boogie Preprocessor took 62.36ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 86.4MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:53:56,845 INFO L158 Benchmark]: RCFGBuilder took 896.97ms. Allocated memory is still 167.8MB. Free memory was 86.4MB in the beginning and 92.3MB in the end (delta: -5.8MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2025-01-08 22:53:56,846 INFO L158 Benchmark]: TraceAbstraction took 7437.75ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 91.5MB in the beginning and 117.2MB in the end (delta: -25.7MB). Peak memory consumption was 145.0MB. Max. memory is 16.1GB. [2025-01-08 22:53:56,846 INFO L158 Benchmark]: Witness Printer took 131.39ms. Allocated memory was 343.9MB in the beginning and 419.4MB in the end (delta: 75.5MB). Free memory was 117.2MB in the beginning and 377.3MB in the end (delta: -260.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:53:56,848 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.18ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.46ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 96.4MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.10ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 91.4MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.36ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 86.4MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 896.97ms. Allocated memory is still 167.8MB. Free memory was 86.4MB in the beginning and 92.3MB in the end (delta: -5.8MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7437.75ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 91.5MB in the beginning and 117.2MB in the end (delta: -25.7MB). Peak memory consumption was 145.0MB. Max. memory is 16.1GB. * Witness Printer took 131.39ms. Allocated memory was 343.9MB in the beginning and 419.4MB in the end (delta: 75.5MB). Free memory was 117.2MB in the beginning and 377.3MB in the end (delta: -260.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 539]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1831 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1831 mSDsluCounter, 1356 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 212 mSDsCounter, 536 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5038 IncrementalHoareTripleChecker+Invalid, 5574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 536 mSolverCounterUnsat, 1144 mSDtfsCounter, 5038 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1414occurred in iteration=11, InterpolantAutomatonStates: 41, 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, 12 MinimizatonAttempts, 567 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2119 NumberOfCodeBlocks, 2119 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2107 ConstructedInterpolants, 0 QuantifiedInterpolants, 5597 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 1039/1039 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: 616]: Loop Invariant Derived loop invariant: ((((((((((a17 == 8) && (a11 == 1)) || ((((((a19 == 0) && (a25 == 1)) && (a11 == 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || (((a11 == 1) && (a17 <= 8)) && (a19 == 1))) || (((a17 == 8) && (a21 == 1)) && (a19 == 1))) || (((a17 == 8) && (a28 <= 8)) && (a21 == 1))) || (((10 <= a28) && (a17 == 8)) && (a21 == 1))) || (((a11 == 1) && (a25 == a19)) && (a17 <= 8))) || ((((a25 == a19) && (a17 <= 8)) && (a19 == 1)) && (a28 <= 7))) || (((a11 == 1) && (a17 <= 8)) && (a28 <= 7))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:53:56,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE