./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label45.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/Problem01_label45.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 b8e8aa0b516ef9fd60c8444f7020a693e2ee03ee59580de825705d1497a8a117 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:53:08,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:53:08,903 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:08,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:53:08,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:53:08,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:53:08,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:53:08,923 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:53:08,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:53:08,923 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:53:08,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:53:08,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:53:08,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:53:08,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:53:08,924 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:53:08,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:08,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:08,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:53:08,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:53:08,925 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 -> b8e8aa0b516ef9fd60c8444f7020a693e2ee03ee59580de825705d1497a8a117 [2025-01-08 22:53:09,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:53:09,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:53:09,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:53:09,159 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:53:09,159 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:53:09,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label45.c [2025-01-08 22:53:10,219 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/446c62689/e485e79e306a476795606306a9691f7c/FLAG6160f26e9 [2025-01-08 22:53:10,579 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:53:10,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label45.c [2025-01-08 22:53:10,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/446c62689/e485e79e306a476795606306a9691f7c/FLAG6160f26e9 [2025-01-08 22:53:10,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/446c62689/e485e79e306a476795606306a9691f7c [2025-01-08 22:53:10,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:53:10,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:53:10,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:53:10,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:53:10,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:53:10,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:53:10" (1/1) ... [2025-01-08 22:53:10,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5a079c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:10, skipping insertion in model container [2025-01-08 22:53:10,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:53:10" (1/1) ... [2025-01-08 22:53:10,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:53:11,026 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/Problem01_label45.c[20099,20112] [2025-01-08 22:53:11,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:53:11,051 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:53:11,103 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/Problem01_label45.c[20099,20112] [2025-01-08 22:53:11,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:53:11,117 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:53:11,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:11 WrapperNode [2025-01-08 22:53:11,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:53:11,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:53:11,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:53:11,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:53:11,122 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:11" (1/1) ... [2025-01-08 22:53:11,131 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:11" (1/1) ... [2025-01-08 22:53:11,159 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-01-08 22:53:11,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:53:11,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:53:11,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:53:11,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:53:11,171 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:11" (1/1) ... [2025-01-08 22:53:11,171 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:11" (1/1) ... [2025-01-08 22:53:11,177 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:11" (1/1) ... [2025-01-08 22:53:11,195 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:11,196 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:11" (1/1) ... [2025-01-08 22:53:11,199 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:11" (1/1) ... [2025-01-08 22:53:11,214 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:11" (1/1) ... [2025-01-08 22:53:11,215 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:11" (1/1) ... [2025-01-08 22:53:11,223 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:11" (1/1) ... [2025-01-08 22:53:11,225 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:11" (1/1) ... [2025-01-08 22:53:11,226 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:11" (1/1) ... [2025-01-08 22:53:11,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:53:11,230 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:53:11,230 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:53:11,231 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:53:11,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:11" (1/1) ... [2025-01-08 22:53:11,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:11,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:53:11,269 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:11,271 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:11,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:53:11,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:53:11,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:53:11,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:53:11,328 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:53:11,330 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:53:11,994 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-01-08 22:53:11,994 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:53:12,002 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:53:12,002 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:53:12,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:53:12 BoogieIcfgContainer [2025-01-08 22:53:12,003 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:53:12,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:53:12,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:53:12,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:53:12,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:53:10" (1/3) ... [2025-01-08 22:53:12,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab515d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:53:12, skipping insertion in model container [2025-01-08 22:53:12,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:11" (2/3) ... [2025-01-08 22:53:12,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab515d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:53:12, skipping insertion in model container [2025-01-08 22:53:12,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:53:12" (3/3) ... [2025-01-08 22:53:12,009 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label45.c [2025-01-08 22:53:12,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:53:12,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label45.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:53:12,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:53:12,061 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;@785f1306, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:53:12,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:53:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:12,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-08 22:53:12,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:12,072 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] [2025-01-08 22:53:12,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:12,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash 99310593, now seen corresponding path program 1 times [2025-01-08 22:53:12,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:12,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679106000] [2025-01-08 22:53:12,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:12,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:12,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-08 22:53:12,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-08 22:53:12,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:12,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:12,458 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:12,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:12,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679106000] [2025-01-08 22:53:12,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679106000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:12,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:12,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:12,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029017414] [2025-01-08 22:53:12,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:12,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:12,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:12,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:12,475 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:12,971 INFO L93 Difference]: Finished difference Result 528 states and 912 transitions. [2025-01-08 22:53:12,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:12,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-01-08 22:53:12,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:12,979 INFO L225 Difference]: With dead ends: 528 [2025-01-08 22:53:12,979 INFO L226 Difference]: Without dead ends: 266 [2025-01-08 22:53:12,982 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:12,983 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:12,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 66 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:53:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-08 22:53:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-01-08 22:53:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 0 states have call successors, (0), 0 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:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2025-01-08 22:53:13,017 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 117 [2025-01-08 22:53:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:13,018 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2025-01-08 22:53:13,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2025-01-08 22:53:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-08 22:53:13,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:13,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:13,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:53:13,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:13,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:13,022 INFO L85 PathProgramCache]: Analyzing trace with hash 538746894, now seen corresponding path program 1 times [2025-01-08 22:53:13,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:13,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056222244] [2025-01-08 22:53:13,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:13,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:13,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-08 22:53:13,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-08 22:53:13,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:13,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:13,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056222244] [2025-01-08 22:53:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056222244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:13,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:13,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:13,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675462533] [2025-01-08 22:53:13,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:13,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:13,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:13,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:13,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:13,168 INFO L87 Difference]: Start difference. First operand 266 states and 380 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:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:13,494 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2025-01-08 22:53:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:13,494 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 122 [2025-01-08 22:53:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:13,497 INFO L225 Difference]: With dead ends: 792 [2025-01-08 22:53:13,497 INFO L226 Difference]: Without dead ends: 528 [2025-01-08 22:53:13,497 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:13,498 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 149 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:13,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 31 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:13,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-01-08 22:53:13,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-01-08 22:53:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.366223908918406) internal successors, (720), 527 states have internal predecessors, (720), 0 states have call successors, (0), 0 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:13,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 720 transitions. [2025-01-08 22:53:13,517 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 720 transitions. Word has length 122 [2025-01-08 22:53:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:13,517 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 720 transitions. [2025-01-08 22:53:13,517 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:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 720 transitions. [2025-01-08 22:53:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-08 22:53:13,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:13,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:13,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:53:13,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:13,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:13,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1328060894, now seen corresponding path program 1 times [2025-01-08 22:53:13,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:13,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91380950] [2025-01-08 22:53:13,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:13,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:13,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-08 22:53:13,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-08 22:53:13,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:13,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:13,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:13,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91380950] [2025-01-08 22:53:13,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91380950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:13,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:13,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:13,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942355123] [2025-01-08 22:53:13,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:13,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:13,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:13,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:13,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:13,714 INFO L87 Difference]: Start difference. First operand 528 states and 720 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:14,056 INFO L93 Difference]: Finished difference Result 1578 states and 2155 transitions. [2025-01-08 22:53:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:14,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-01-08 22:53:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:14,060 INFO L225 Difference]: With dead ends: 1578 [2025-01-08 22:53:14,060 INFO L226 Difference]: Without dead ends: 1052 [2025-01-08 22:53:14,061 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:14,062 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 125 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:14,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 68 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-01-08 22:53:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 790. [2025-01-08 22:53:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.282636248415716) internal successors, (1012), 789 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1012 transitions. [2025-01-08 22:53:14,082 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1012 transitions. Word has length 130 [2025-01-08 22:53:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:14,083 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1012 transitions. [2025-01-08 22:53:14,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1012 transitions. [2025-01-08 22:53:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-08 22:53:14,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:14,088 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 22:53:14,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:53:14,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:14,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:14,089 INFO L85 PathProgramCache]: Analyzing trace with hash -124226403, now seen corresponding path program 1 times [2025-01-08 22:53:14,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:14,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481632729] [2025-01-08 22:53:14,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:14,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:14,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-08 22:53:14,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-08 22:53:14,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:14,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-08 22:53:14,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:14,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481632729] [2025-01-08 22:53:14,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481632729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:14,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:14,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:14,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904679952] [2025-01-08 22:53:14,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:14,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:53:14,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:14,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:53:14,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:53:14,255 INFO L87 Difference]: Start difference. First operand 790 states and 1012 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:14,670 INFO L93 Difference]: Finished difference Result 1709 states and 2165 transitions. [2025-01-08 22:53:14,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:53:14,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 151 [2025-01-08 22:53:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:14,673 INFO L225 Difference]: With dead ends: 1709 [2025-01-08 22:53:14,673 INFO L226 Difference]: Without dead ends: 921 [2025-01-08 22:53:14,674 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:14,675 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 393 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:14,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 41 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:53:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-01-08 22:53:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 790. [2025-01-08 22:53:14,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.2750316856780735) internal successors, (1006), 789 states have internal predecessors, (1006), 0 states have call successors, (0), 0 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:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1006 transitions. [2025-01-08 22:53:14,686 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1006 transitions. Word has length 151 [2025-01-08 22:53:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:14,686 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1006 transitions. [2025-01-08 22:53:14,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1006 transitions. [2025-01-08 22:53:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-08 22:53:14,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:14,689 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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:14,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:53:14,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:14,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:14,689 INFO L85 PathProgramCache]: Analyzing trace with hash 927873636, now seen corresponding path program 1 times [2025-01-08 22:53:14,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:14,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567935981] [2025-01-08 22:53:14,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:14,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:14,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-08 22:53:14,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-08 22:53:14,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:14,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-08 22:53:14,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:14,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567935981] [2025-01-08 22:53:14,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567935981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:14,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:14,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:14,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863241084] [2025-01-08 22:53:14,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:14,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:14,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:14,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:14,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:14,780 INFO L87 Difference]: Start difference. First operand 790 states and 1006 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:15,182 INFO L93 Difference]: Finished difference Result 2233 states and 2834 transitions. [2025-01-08 22:53:15,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:15,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:15,187 INFO L225 Difference]: With dead ends: 2233 [2025-01-08 22:53:15,187 INFO L226 Difference]: Without dead ends: 1445 [2025-01-08 22:53:15,189 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:15,190 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 136 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:15,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 24 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:53:15,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-01-08 22:53:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2025-01-08 22:53:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.2808798646362098) internal successors, (1514), 1182 states have internal predecessors, (1514), 0 states have call successors, (0), 0 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:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1514 transitions. [2025-01-08 22:53:15,214 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1514 transitions. Word has length 160 [2025-01-08 22:53:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:15,214 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1514 transitions. [2025-01-08 22:53:15,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1514 transitions. [2025-01-08 22:53:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-08 22:53:15,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:15,217 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2025-01-08 22:53:15,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:53:15,217 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:15,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1266246942, now seen corresponding path program 1 times [2025-01-08 22:53:15,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:15,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422549831] [2025-01-08 22:53:15,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:15,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:15,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-08 22:53:15,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-08 22:53:15,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:15,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-08 22:53:15,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:15,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422549831] [2025-01-08 22:53:15,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422549831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:15,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:15,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:15,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983911574] [2025-01-08 22:53:15,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:15,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:15,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:15,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:15,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:15,425 INFO L87 Difference]: Start difference. First operand 1183 states and 1514 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:15,776 INFO L93 Difference]: Finished difference Result 2495 states and 3199 transitions. [2025-01-08 22:53:15,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:15,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2025-01-08 22:53:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:15,780 INFO L225 Difference]: With dead ends: 2495 [2025-01-08 22:53:15,780 INFO L226 Difference]: Without dead ends: 1314 [2025-01-08 22:53:15,781 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:15,782 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:15,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 62 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:15,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-01-08 22:53:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1314. [2025-01-08 22:53:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.2665651180502666) internal successors, (1663), 1313 states have internal predecessors, (1663), 0 states have call successors, (0), 0 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:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1663 transitions. [2025-01-08 22:53:15,819 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1663 transitions. Word has length 176 [2025-01-08 22:53:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:15,819 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1663 transitions. [2025-01-08 22:53:15,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1663 transitions. [2025-01-08 22:53:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-08 22:53:15,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:15,821 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:53:15,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:15,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:15,821 INFO L85 PathProgramCache]: Analyzing trace with hash 380009701, now seen corresponding path program 1 times [2025-01-08 22:53:15,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:15,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889345953] [2025-01-08 22:53:15,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:15,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:15,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-08 22:53:15,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-08 22:53:15,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:15,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:53:16,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:16,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889345953] [2025-01-08 22:53:16,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889345953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:16,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:16,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:53:16,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500732008] [2025-01-08 22:53:16,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:16,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:53:16,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:16,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:53:16,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:53:16,115 INFO L87 Difference]: Start difference. First operand 1314 states and 1663 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 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:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:16,631 INFO L93 Difference]: Finished difference Result 3805 states and 4775 transitions. [2025-01-08 22:53:16,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:53:16,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 186 [2025-01-08 22:53:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:16,637 INFO L225 Difference]: With dead ends: 3805 [2025-01-08 22:53:16,637 INFO L226 Difference]: Without dead ends: 2362 [2025-01-08 22:53:16,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:53:16,639 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 250 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:16,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 40 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:53:16,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-01-08 22:53:16,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1838. [2025-01-08 22:53:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.2275449101796407) internal successors, (2255), 1837 states have internal predecessors, (2255), 0 states have call successors, (0), 0 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:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2255 transitions. [2025-01-08 22:53:16,668 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2255 transitions. Word has length 186 [2025-01-08 22:53:16,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:16,668 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2255 transitions. [2025-01-08 22:53:16,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 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:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2255 transitions. [2025-01-08 22:53:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-08 22:53:16,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:16,672 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:53:16,672 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:16,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash 690345149, now seen corresponding path program 1 times [2025-01-08 22:53:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:16,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997885778] [2025-01-08 22:53:16,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:16,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:16,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-08 22:53:16,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-08 22:53:16,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:16,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:53:16,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:16,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997885778] [2025-01-08 22:53:16,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997885778] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:53:16,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008576790] [2025-01-08 22:53:16,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:16,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:53:16,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:53:16,944 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:53:16,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:53:16,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-08 22:53:17,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-08 22:53:17,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:17,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:17,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:53:17,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:53:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-08 22:53:17,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:53:17,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008576790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:17,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:53:17,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 22:53:17,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130873602] [2025-01-08 22:53:17,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:17,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:17,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:17,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:17,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:53:17,217 INFO L87 Difference]: Start difference. First operand 1838 states and 2255 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:17,537 INFO L93 Difference]: Finished difference Result 4198 states and 5218 transitions. [2025-01-08 22:53:17,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:17,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 203 [2025-01-08 22:53:17,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:17,543 INFO L225 Difference]: With dead ends: 4198 [2025-01-08 22:53:17,544 INFO L226 Difference]: Without dead ends: 2362 [2025-01-08 22:53:17,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:53:17,545 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:17,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 192 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-01-08 22:53:17,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2100. [2025-01-08 22:53:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.2172463077656026) internal successors, (2555), 2099 states have internal predecessors, (2555), 0 states have call successors, (0), 0 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:17,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2555 transitions. [2025-01-08 22:53:17,572 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2555 transitions. Word has length 203 [2025-01-08 22:53:17,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:17,573 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2555 transitions. [2025-01-08 22:53:17,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2555 transitions. [2025-01-08 22:53:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-08 22:53:17,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:17,577 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 22:53:17,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:53:17,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:53:17,778 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:17,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash -250722507, now seen corresponding path program 1 times [2025-01-08 22:53:17,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:17,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571931830] [2025-01-08 22:53:17,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:17,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:17,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-08 22:53:17,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-08 22:53:17,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:17,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:18,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:18,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571931830] [2025-01-08 22:53:18,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571931830] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:53:18,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608803976] [2025-01-08 22:53:18,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:18,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:53:18,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:53:18,127 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:53:18,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:53:18,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-08 22:53:18,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-08 22:53:18,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:18,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:18,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:53:18,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:53:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-08 22:53:18,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:53:18,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608803976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:18,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:53:18,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 22:53:18,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542291486] [2025-01-08 22:53:18,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:18,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:18,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:18,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:18,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:53:18,377 INFO L87 Difference]: Start difference. First operand 2100 states and 2555 transitions. Second operand has 3 states, 3 states have (on average 63.0) 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:18,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:18,676 INFO L93 Difference]: Finished difference Result 4196 states and 5016 transitions. [2025-01-08 22:53:18,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:18,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) 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 236 [2025-01-08 22:53:18,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:18,677 INFO L225 Difference]: With dead ends: 4196 [2025-01-08 22:53:18,677 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:53:18,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:53:18,680 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:18,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 27 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:18,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:53:18,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:53:18,681 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:18,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:53:18,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 236 [2025-01-08 22:53:18,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:18,681 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:53:18,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) 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:18,682 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:53:18,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:53:18,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:53:18,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:53:18,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:53:18,890 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:18,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:53:19,041 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:53:19,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:53:19 BoogieIcfgContainer [2025-01-08 22:53:19,058 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:53:19,058 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:53:19,058 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:53:19,058 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:53:19,059 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:12" (3/4) ... [2025-01-08 22:53:19,061 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:53:19,075 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 22:53:19,075 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:53:19,076 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:53:19,076 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:53:19,172 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:53:19,173 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:53:19,173 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:53:19,173 INFO L158 Benchmark]: Toolchain (without parser) took 8358.43ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 112.2MB in the beginning and 146.0MB in the end (delta: -33.7MB). Peak memory consumption was 167.3MB. Max. memory is 16.1GB. [2025-01-08 22:53:19,174 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:53:19,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.99ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 85.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:53:19,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.78ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 79.6MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:53:19,178 INFO L158 Benchmark]: Boogie Preprocessor took 69.59ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 74.9MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:53:19,178 INFO L158 Benchmark]: RCFGBuilder took 772.33ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 59.4MB in the end (delta: 15.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-08 22:53:19,178 INFO L158 Benchmark]: TraceAbstraction took 7053.83ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 58.4MB in the beginning and 157.2MB in the end (delta: -98.8MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. [2025-01-08 22:53:19,178 INFO L158 Benchmark]: Witness Printer took 114.83ms. Allocated memory is still 343.9MB. Free memory was 157.2MB in the beginning and 146.0MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:53:19,179 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.17ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.99ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 85.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.78ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 79.6MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.59ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 74.9MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 772.33ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 59.4MB in the end (delta: 15.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7053.83ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 58.4MB in the beginning and 157.2MB in the end (delta: -98.8MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. * Witness Printer took 114.83ms. Allocated memory is still 343.9MB. Free memory was 157.2MB in the beginning and 146.0MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 537]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1290 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1290 mSDsluCounter, 551 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 675 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3489 IncrementalHoareTripleChecker+Invalid, 4164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 675 mSolverCounterUnsat, 495 mSDtfsCounter, 3489 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=8, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1441 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1920 NumberOfCodeBlocks, 1920 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1909 ConstructedInterpolants, 0 QuantifiedInterpolants, 4848 SizeOfPredicates, 0 NumberOfNonLiveVariables, 771 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 932/989 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: 593]: Loop Invariant Derived loop invariant: ((((((a21 < 1) || (((a21 == 1) && (a17 == 1)) && (a20 == 1))) || ((a7 != 1) && (a16 <= 4))) || ((a7 != 1) && (15 <= a8))) || (((14 <= a8) && (a21 == 1)) && (a20 == 1))) || ((14 <= a8) && (a16 <= 5))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:53:19,202 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