./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 3888704d5a955b45281a90f2156d0109c7e11fdda93c54cd78435365c9c632be --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:09:04,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:09:04,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:09:04,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:09:04,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:09:04,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:09:04,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:09:04,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:09:04,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:09:04,838 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:09:04,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:09:04,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:09:04,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:09:04,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:09:04,838 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:09:04,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:09:04,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:09:04,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:09:04,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:09:04,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:09:04,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:09:04,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:09:04,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:09:04,839 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:09:04,839 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:09:04,840 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:09:04,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:09:04,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:09:04,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:09:04,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:09:04,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:09:04,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:09:04,840 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:09:04,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:09:04,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:09:04,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:09:04,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:09:04,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:09:04,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:09:04,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:09:04,841 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3888704d5a955b45281a90f2156d0109c7e11fdda93c54cd78435365c9c632be [2025-02-08 00:09:05,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:09:05,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:09:05,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:09:05,257 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:09:05,258 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:09:05,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2025-02-08 00:09:06,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73416b880/20266d6634684ff6be7f6c4812127306/FLAG985736441 [2025-02-08 00:09:07,149 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:09:07,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2025-02-08 00:09:07,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73416b880/20266d6634684ff6be7f6c4812127306/FLAG985736441 [2025-02-08 00:09:07,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73416b880/20266d6634684ff6be7f6c4812127306 [2025-02-08 00:09:07,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:09:07,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:09:07,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:09:07,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:09:07,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:09:07,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:09:07" (1/1) ... [2025-02-08 00:09:07,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e5863a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07, skipping insertion in model container [2025-02-08 00:09:07,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:09:07" (1/1) ... [2025-02-08 00:09:07,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:09:07,635 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c[1266,1279] [2025-02-08 00:09:07,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:09:07,694 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:09:07,703 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c[1266,1279] [2025-02-08 00:09:07,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:09:07,811 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:09:07,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07 WrapperNode [2025-02-08 00:09:07,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:09:07,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:09:07,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:09:07,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:09:07,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07" (1/1) ... [2025-02-08 00:09:07,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07" (1/1) ... [2025-02-08 00:09:07,937 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 412 [2025-02-08 00:09:07,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:09:07,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:09:07,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:09:07,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:09:07,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07" (1/1) ... [2025-02-08 00:09:07,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07" (1/1) ... [2025-02-08 00:09:07,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07" (1/1) ... [2025-02-08 00:09:08,001 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-02-08 00:09:08,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07" (1/1) ... [2025-02-08 00:09:08,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07" (1/1) ... [2025-02-08 00:09:08,019 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07" (1/1) ... [2025-02-08 00:09:08,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07" (1/1) ... [2025-02-08 00:09:08,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07" (1/1) ... [2025-02-08 00:09:08,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07" (1/1) ... [2025-02-08 00:09:08,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:09:08,034 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:09:08,034 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:09:08,034 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:09:08,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07" (1/1) ... [2025-02-08 00:09:08,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:09:08,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:08,076 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-02-08 00:09:08,084 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-02-08 00:09:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:09:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:09:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:09:08,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:09:08,180 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:09:08,181 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:09:08,592 INFO L? ?]: Removed 178 outVars from TransFormulas that were not future-live. [2025-02-08 00:09:08,592 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:09:08,666 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:09:08,666 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:09:08,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:09:08 BoogieIcfgContainer [2025-02-08 00:09:08,667 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:09:08,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:09:08,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:09:08,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:09:08,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:09:07" (1/3) ... [2025-02-08 00:09:08,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a9826f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:09:08, skipping insertion in model container [2025-02-08 00:09:08,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:07" (2/3) ... [2025-02-08 00:09:08,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a9826f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:09:08, skipping insertion in model container [2025-02-08 00:09:08,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:09:08" (3/3) ... [2025-02-08 00:09:08,688 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2025-02-08 00:09:08,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:09:08,730 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c that has 1 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:09:08,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:09:08,866 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;@2250d538, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:09:08,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:09:08,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 0 states have call successors, (0), 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-02-08 00:09:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 00:09:08,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:08,889 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] [2025-02-08 00:09:08,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:08,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:08,898 INFO L85 PathProgramCache]: Analyzing trace with hash -646923280, now seen corresponding path program 1 times [2025-02-08 00:09:08,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:08,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826929118] [2025-02-08 00:09:08,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:08,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:09,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 00:09:09,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 00:09:09,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:09,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:09,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:09,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826929118] [2025-02-08 00:09:09,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826929118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:09,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:09,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:09:09,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112891278] [2025-02-08 00:09:09,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:09,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:09:09,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:09,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:09:09,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:09,553 INFO L87 Difference]: Start difference. First operand has 76 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 0 states have call successors, (0), 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 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-02-08 00:09:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:09,675 INFO L93 Difference]: Finished difference Result 123 states and 181 transitions. [2025-02-08 00:09:09,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:09:09,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-08 00:09:09,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:09,685 INFO L225 Difference]: With dead ends: 123 [2025-02-08 00:09:09,686 INFO L226 Difference]: Without dead ends: 76 [2025-02-08 00:09:09,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:09,693 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:09,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-08 00:09:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-08 00:09:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-08 00:09:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 110 transitions. [2025-02-08 00:09:09,735 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 110 transitions. Word has length 28 [2025-02-08 00:09:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:09,736 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 110 transitions. [2025-02-08 00:09:09,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-02-08 00:09:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 110 transitions. [2025-02-08 00:09:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 00:09:09,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:09,738 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] [2025-02-08 00:09:09,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:09:09,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:09,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:09,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1424893978, now seen corresponding path program 1 times [2025-02-08 00:09:09,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:09,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321903250] [2025-02-08 00:09:09,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:09,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:09,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 00:09:09,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 00:09:09,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:09,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:09,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:09,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321903250] [2025-02-08 00:09:09,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321903250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:09,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:09,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:09:09,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094427795] [2025-02-08 00:09:09,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:09,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:09:09,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:09,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:09:09,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:09,963 INFO L87 Difference]: Start difference. First operand 76 states and 110 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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-02-08 00:09:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:10,112 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2025-02-08 00:09:10,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:09:10,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-02-08 00:09:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:10,121 INFO L225 Difference]: With dead ends: 125 [2025-02-08 00:09:10,122 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 00:09:10,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:10,123 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:10,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 00:09:10,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-08 00:09:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2025-02-08 00:09:10,137 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 29 [2025-02-08 00:09:10,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:10,138 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2025-02-08 00:09:10,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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-02-08 00:09:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2025-02-08 00:09:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 00:09:10,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:10,139 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] [2025-02-08 00:09:10,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:09:10,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:10,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1141417685, now seen corresponding path program 1 times [2025-02-08 00:09:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202955796] [2025-02-08 00:09:10,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:10,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 00:09:10,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 00:09:10,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:10,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:10,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:10,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202955796] [2025-02-08 00:09:10,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202955796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:10,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:10,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:09:10,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702298580] [2025-02-08 00:09:10,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:10,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:09:10,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:10,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:09:10,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:09:10,847 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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-02-08 00:09:11,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:11,008 INFO L93 Difference]: Finished difference Result 131 states and 187 transitions. [2025-02-08 00:09:11,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:09:11,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-02-08 00:09:11,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:11,009 INFO L225 Difference]: With dead ends: 131 [2025-02-08 00:09:11,009 INFO L226 Difference]: Without dead ends: 82 [2025-02-08 00:09:11,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:09:11,010 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 94 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:11,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 377 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-08 00:09:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-02-08 00:09:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.45) internal successors, (116), 80 states have internal predecessors, (116), 0 states have call successors, (0), 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-02-08 00:09:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2025-02-08 00:09:11,014 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 30 [2025-02-08 00:09:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:11,015 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2025-02-08 00:09:11,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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-02-08 00:09:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2025-02-08 00:09:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 00:09:11,016 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:11,016 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] [2025-02-08 00:09:11,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:09:11,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:11,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:11,016 INFO L85 PathProgramCache]: Analyzing trace with hash -154952431, now seen corresponding path program 1 times [2025-02-08 00:09:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:11,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729305237] [2025-02-08 00:09:11,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:11,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 00:09:11,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 00:09:11,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:11,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:09:11,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:09:11,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 00:09:11,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 00:09:11,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:11,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:09:11,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:09:11,101 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:09:11,101 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:09:11,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:09:11,105 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 00:09:11,120 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:09:11,126 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:09:11,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:09:11 BoogieIcfgContainer [2025-02-08 00:09:11,128 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:09:11,129 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:09:11,129 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:09:11,129 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:09:11,129 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:09:08" (3/4) ... [2025-02-08 00:09:11,131 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:09:11,132 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:09:11,133 INFO L158 Benchmark]: Toolchain (without parser) took 3653.77ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 113.5MB in the beginning and 227.3MB in the end (delta: -113.8MB). Peak memory consumption was 174.2MB. Max. memory is 16.1GB. [2025-02-08 00:09:11,133 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:11,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.61ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 97.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:09:11,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.55ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 90.0MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:09:11,133 INFO L158 Benchmark]: Boogie Preprocessor took 94.99ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 85.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:11,134 INFO L158 Benchmark]: IcfgBuilder took 632.55ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 107.3MB in the end (delta: -21.4MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2025-02-08 00:09:11,134 INFO L158 Benchmark]: TraceAbstraction took 2452.22ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 106.5MB in the beginning and 227.3MB in the end (delta: -120.8MB). Peak memory consumption was 166.6MB. Max. memory is 16.1GB. [2025-02-08 00:09:11,134 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 427.8MB. Free memory was 227.3MB in the beginning and 227.3MB in the end (delta: 13.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:11,135 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.28ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.61ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 97.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.55ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 90.0MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.99ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 85.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 632.55ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 107.3MB in the end (delta: -21.4MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2452.22ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 106.5MB in the beginning and 227.3MB in the end (delta: -120.8MB). Peak memory consumption was 166.6MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 427.8MB. Free memory was 227.3MB in the beginning and 227.3MB in the end (delta: 13.7kB). There was no memory consumed. 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 141. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 4); [L36] const SORT_31 msb_SORT_31 = (SORT_31)1 << (4 - 1); [L38] const SORT_67 mask_SORT_67 = (SORT_67)-1 >> (sizeof(SORT_67) * 8 - 10); [L39] const SORT_67 msb_SORT_67 = (SORT_67)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_21 = 1; [L45] SORT_1 input_2; [L46] SORT_3 input_4; [L47] SORT_1 input_5; [L48] SORT_1 input_6; [L49] SORT_1 input_29; [L50] SORT_31 input_32; [L51] SORT_31 input_34; [L52] SORT_1 input_36; [L53] SORT_1 input_38; [L54] SORT_1 input_42; [L55] SORT_1 input_44; [L56] SORT_1 input_46; [L57] SORT_1 input_48; [L58] SORT_3 input_50; [L59] SORT_1 input_53; [L60] SORT_1 input_55; [L61] SORT_1 input_59; [L62] SORT_1 input_63; [L63] SORT_1 input_65; [L64] SORT_67 input_68; [L65] SORT_1 input_70; [L66] SORT_1 input_72; [L67] SORT_1 input_78; [L68] SORT_1 input_85; [L69] SORT_1 input_91; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L71] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L72] SORT_1 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L73] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L74] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L75] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L76] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L77] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] SORT_1 init_9_arg_1 = var_7; [L80] state_8 = init_9_arg_1 [L81] SORT_1 init_15_arg_1 = var_7; [L82] state_14 = init_15_arg_1 [L83] SORT_1 init_26_arg_1 = var_7; [L84] state_25 = init_26_arg_1 [L85] SORT_1 init_28_arg_1 = var_7; [L86] state_27 = init_28_arg_1 [L87] SORT_1 init_41_arg_1 = var_7; [L88] state_40 = init_41_arg_1 [L89] SORT_1 init_58_arg_1 = var_7; [L90] state_57 = init_58_arg_1 [L91] SORT_1 init_62_arg_1 = var_7; [L92] state_61 = init_62_arg_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L95] input_2 = __VERIFIER_nondet_uchar() [L96] input_4 = __VERIFIER_nondet_uchar() [L97] input_5 = __VERIFIER_nondet_uchar() [L98] input_6 = __VERIFIER_nondet_uchar() [L99] input_29 = __VERIFIER_nondet_uchar() [L100] input_32 = __VERIFIER_nondet_uchar() [L101] input_34 = __VERIFIER_nondet_uchar() [L102] input_36 = __VERIFIER_nondet_uchar() [L103] input_38 = __VERIFIER_nondet_uchar() [L104] input_42 = __VERIFIER_nondet_uchar() [L105] input_44 = __VERIFIER_nondet_uchar() [L106] input_46 = __VERIFIER_nondet_uchar() [L107] input_48 = __VERIFIER_nondet_uchar() [L108] input_50 = __VERIFIER_nondet_uchar() [L109] input_53 = __VERIFIER_nondet_uchar() [L110] input_55 = __VERIFIER_nondet_uchar() [L111] input_59 = __VERIFIER_nondet_uchar() [L112] input_63 = __VERIFIER_nondet_uchar() [L113] input_65 = __VERIFIER_nondet_uchar() [L114] input_68 = __VERIFIER_nondet_ushort() [L115] input_70 = __VERIFIER_nondet_uchar() [L116] input_72 = __VERIFIER_nondet_uchar() [L117] input_78 = __VERIFIER_nondet_uchar() [L118] input_85 = __VERIFIER_nondet_uchar() [L119] input_91 = __VERIFIER_nondet_uchar() [L122] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_11_arg_0=0, var_12=0, var_21=1, var_7=0] [L123] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L123] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L124] SORT_10 var_11 = var_11_arg_0; [L125] SORT_10 var_13_arg_0 = var_11; [L126] SORT_10 var_13_arg_1 = var_12; [L127] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L128] SORT_1 var_16_arg_0 = state_14; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_13=1, var_16_arg_0=0, var_21=1, var_7=0] [L129] EXPR var_16_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_13=1, var_21=1, var_7=0] [L129] var_16_arg_0 = var_16_arg_0 & mask_SORT_1 [L130] SORT_10 var_16 = var_16_arg_0; [L131] SORT_10 var_17_arg_0 = var_16; [L132] SORT_10 var_17_arg_1 = var_12; [L133] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L134] SORT_1 var_18_arg_0 = var_13; [L135] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_7=0] [L136] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L136] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L137] SORT_1 var_22_arg_0 = var_18; [L138] SORT_1 var_22 = ~var_22_arg_0; [L139] SORT_1 var_23_arg_0 = var_21; [L140] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-2, var_7=0] [L141] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L141] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L142] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L142] var_23 = var_23 & mask_SORT_1 [L143] SORT_1 bad_24_arg_0 = var_23; [L144] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 898 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 642 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 279 IncrementalHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 256 mSDtfsCounter, 279 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=3, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 193 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 00:09:11,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 3888704d5a955b45281a90f2156d0109c7e11fdda93c54cd78435365c9c632be --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:09:13,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:09:13,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:09:13,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:09:13,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:09:13,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:09:13,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:09:13,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:09:13,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:09:13,859 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:09:13,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:09:13,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:09:13,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:09:13,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:09:13,861 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:09:13,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:09:13,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:09:13,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:09:13,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:09:13,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:09:13,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:09:13,862 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:09:13,862 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:09:13,862 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:09:13,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:09:13,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:09:13,862 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:09:13,863 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:09:13,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:09:13,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:09:13,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:09:13,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:09:13,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:09:13,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:09:13,863 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:09:13,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:09:13,863 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:09:13,863 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:09:13,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:09:13,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:09:13,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:09:13,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:09:13,863 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3888704d5a955b45281a90f2156d0109c7e11fdda93c54cd78435365c9c632be [2025-02-08 00:09:14,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:09:14,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:09:14,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:09:14,410 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:09:14,411 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:09:14,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2025-02-08 00:09:15,904 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cbc4fac0/80984d57f8d740c49046a4423f384956/FLAGd5e257052 [2025-02-08 00:09:16,136 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:09:16,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2025-02-08 00:09:16,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cbc4fac0/80984d57f8d740c49046a4423f384956/FLAGd5e257052 [2025-02-08 00:09:16,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cbc4fac0/80984d57f8d740c49046a4423f384956 [2025-02-08 00:09:16,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:09:16,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:09:16,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:09:16,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:09:16,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:09:16,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:09:16" (1/1) ... [2025-02-08 00:09:16,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@228f8a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16, skipping insertion in model container [2025-02-08 00:09:16,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:09:16" (1/1) ... [2025-02-08 00:09:16,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:09:16,602 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c[1266,1279] [2025-02-08 00:09:16,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:09:16,656 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:09:16,665 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c[1266,1279] [2025-02-08 00:09:16,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:09:16,699 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:09:16,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16 WrapperNode [2025-02-08 00:09:16,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:09:16,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:09:16,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:09:16,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:09:16,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16" (1/1) ... [2025-02-08 00:09:16,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16" (1/1) ... [2025-02-08 00:09:16,740 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 276 [2025-02-08 00:09:16,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:09:16,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:09:16,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:09:16,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:09:16,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16" (1/1) ... [2025-02-08 00:09:16,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16" (1/1) ... [2025-02-08 00:09:16,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16" (1/1) ... [2025-02-08 00:09:16,771 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-02-08 00:09:16,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16" (1/1) ... [2025-02-08 00:09:16,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16" (1/1) ... [2025-02-08 00:09:16,776 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16" (1/1) ... [2025-02-08 00:09:16,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16" (1/1) ... [2025-02-08 00:09:16,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16" (1/1) ... [2025-02-08 00:09:16,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16" (1/1) ... [2025-02-08 00:09:16,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:09:16,787 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:09:16,787 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:09:16,788 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:09:16,790 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16" (1/1) ... [2025-02-08 00:09:16,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:09:16,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:16,831 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-02-08 00:09:16,835 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-02-08 00:09:16,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:09:16,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:09:16,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:09:16,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:09:16,925 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:09:16,927 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:09:17,165 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2025-02-08 00:09:17,165 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:09:17,171 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:09:17,171 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:09:17,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:09:17 BoogieIcfgContainer [2025-02-08 00:09:17,172 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:09:17,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:09:17,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:09:17,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:09:17,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:09:16" (1/3) ... [2025-02-08 00:09:17,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d857c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:09:17, skipping insertion in model container [2025-02-08 00:09:17,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:16" (2/3) ... [2025-02-08 00:09:17,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d857c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:09:17, skipping insertion in model container [2025-02-08 00:09:17,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:09:17" (3/3) ... [2025-02-08 00:09:17,181 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2025-02-08 00:09:17,195 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:09:17,199 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:09:17,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:09:17,243 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;@49546e9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:09:17,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:09:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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-02-08 00:09:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:09:17,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:17,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:09:17,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:17,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:17,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:09:17,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:09:17,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777238572] [2025-02-08 00:09:17,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:17,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:17,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:17,272 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-02-08 00:09:17,278 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-02-08 00:09:17,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:09:17,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:09:17,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:17,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:17,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 00:09:17,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:17,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:09:17,639 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:09:17,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777238572] [2025-02-08 00:09:17,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777238572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:17,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:17,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:09:17,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819912005] [2025-02-08 00:09:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:17,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:09:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:09:17,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:09:17,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:17,661 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-02-08 00:09:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:17,703 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-08 00:09:17,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:09:17,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-02-08 00:09:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:17,710 INFO L225 Difference]: With dead ends: 16 [2025-02-08 00:09:17,710 INFO L226 Difference]: Without dead ends: 9 [2025-02-08 00:09:17,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:09:17,715 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:17,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:09:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-08 00:09:17,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-08 00:09:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 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-02-08 00:09:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:09:17,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:09:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:17,739 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:09:17,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-02-08 00:09:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:09:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:09:17,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:17,739 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:09:17,748 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-02-08 00:09:17,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:17,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:17,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:17,946 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:09:17,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:09:17,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1170198108] [2025-02-08 00:09:17,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:17,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:17,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:17,950 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-02-08 00:09:17,952 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-02-08 00:09:18,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:09:18,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:09:18,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:18,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:18,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 00:09:18,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:18,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:09:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:19,828 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:09:19,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170198108] [2025-02-08 00:09:19,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170198108] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:09:19,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:09:19,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-08 00:09:19,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327816055] [2025-02-08 00:09:19,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 00:09:19,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:09:19,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:09:19,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:09:19,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:09:19,831 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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-02-08 00:09:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:19,925 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-02-08 00:09:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:09:19,926 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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 7 [2025-02-08 00:09:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:19,926 INFO L225 Difference]: With dead ends: 14 [2025-02-08 00:09:19,926 INFO L226 Difference]: Without dead ends: 12 [2025-02-08 00:09:19,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:09:19,928 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:19,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:09:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-08 00:09:19,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-02-08 00:09:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 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-02-08 00:09:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-08 00:09:19,930 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-08 00:09:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:19,931 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-08 00:09:19,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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-02-08 00:09:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-08 00:09:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 00:09:19,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:19,931 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-08 00:09:19,942 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-02-08 00:09:20,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:20,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:20,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:20,134 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-08 00:09:20,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:09:20,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810945722] [2025-02-08 00:09:20,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:09:20,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:20,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:20,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:09:20,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 00:09:20,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 00:09:20,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 00:09:20,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:09:20,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:20,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 00:09:20,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:20,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:09:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:23,722 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:09:23,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810945722] [2025-02-08 00:09:23,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810945722] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:09:23,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:09:23,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-08 00:09:23,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122854462] [2025-02-08 00:09:23,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 00:09:23,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 00:09:23,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:09:23,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 00:09:23,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:09:23,725 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 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-02-08 00:09:23,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:23,894 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2025-02-08 00:09:23,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:09:23,898 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 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 10 [2025-02-08 00:09:23,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:23,899 INFO L225 Difference]: With dead ends: 17 [2025-02-08 00:09:23,899 INFO L226 Difference]: Without dead ends: 15 [2025-02-08 00:09:23,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:09:23,900 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:23,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 20 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:23,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-08 00:09:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-02-08 00:09:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 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-02-08 00:09:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-02-08 00:09:23,906 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2025-02-08 00:09:23,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:23,906 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-02-08 00:09:23,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 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-02-08 00:09:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-02-08 00:09:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 00:09:23,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:23,907 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-02-08 00:09:23,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 00:09:24,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:24,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:24,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:24,116 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 3 times [2025-02-08 00:09:24,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:09:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072127080] [2025-02-08 00:09:24,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 00:09:24,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:24,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:24,119 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:09:24,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 00:09:24,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-02-08 00:09:24,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 7 of 13 statements. [2025-02-08 00:09:24,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 00:09:24,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:24,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 00:09:24,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 00:09:24,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:09:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 00:09:26,749 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:09:26,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072127080] [2025-02-08 00:09:26,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072127080] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:09:26,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:09:26,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-02-08 00:09:26,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148562519] [2025-02-08 00:09:26,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 00:09:26,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:09:26,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:09:26,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:09:26,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:09:26,751 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-08 00:09:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:26,810 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-02-08 00:09:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:09:26,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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 13 [2025-02-08 00:09:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:26,811 INFO L225 Difference]: With dead ends: 14 [2025-02-08 00:09:26,811 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 00:09:26,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:09:26,812 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:26,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:09:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 00:09:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 00:09:26,814 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-02-08 00:09:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 00:09:26,814 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2025-02-08 00:09:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:26,814 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 00:09:26,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-08 00:09:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 00:09:26,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 00:09:26,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:09:26,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 00:09:27,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:27,026 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-02-08 00:09:27,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 00:09:27,103 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:09:27,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:09:27 BoogieIcfgContainer [2025-02-08 00:09:27,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:09:27,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:09:27,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:09:27,115 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:09:27,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:09:17" (3/4) ... [2025-02-08 00:09:27,118 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 00:09:27,127 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 00:09:27,128 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 00:09:27,128 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 00:09:27,129 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 00:09:27,213 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 00:09:27,214 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 00:09:27,214 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:09:27,215 INFO L158 Benchmark]: Toolchain (without parser) took 10725.71ms. Allocated memory was 83.9MB in the beginning and 419.4MB in the end (delta: 335.5MB). Free memory was 59.1MB in the beginning and 336.6MB in the end (delta: -277.4MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2025-02-08 00:09:27,215 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 46.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:27,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.56ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 42.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:09:27,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.07ms. Allocated memory is still 83.9MB. Free memory was 42.9MB in the beginning and 40.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:27,216 INFO L158 Benchmark]: Boogie Preprocessor took 43.51ms. Allocated memory is still 83.9MB. Free memory was 40.5MB in the beginning and 38.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:27,216 INFO L158 Benchmark]: IcfgBuilder took 384.61ms. Allocated memory is still 83.9MB. Free memory was 38.1MB in the beginning and 45.8MB in the end (delta: -7.7MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2025-02-08 00:09:27,216 INFO L158 Benchmark]: TraceAbstraction took 9940.37ms. Allocated memory was 83.9MB in the beginning and 419.4MB in the end (delta: 335.5MB). Free memory was 45.1MB in the beginning and 344.8MB in the end (delta: -299.7MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2025-02-08 00:09:27,216 INFO L158 Benchmark]: Witness Printer took 99.34ms. Allocated memory is still 419.4MB. Free memory was 344.8MB in the beginning and 336.6MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:09:27,218 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.19ms. Allocated memory is still 83.9MB. Free memory is still 46.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.56ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 42.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.07ms. Allocated memory is still 83.9MB. Free memory was 42.9MB in the beginning and 40.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.51ms. Allocated memory is still 83.9MB. Free memory was 40.5MB in the beginning and 38.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 384.61ms. Allocated memory is still 83.9MB. Free memory was 38.1MB in the beginning and 45.8MB in the end (delta: -7.7MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9940.37ms. Allocated memory was 83.9MB in the beginning and 419.4MB in the end (delta: 335.5MB). Free memory was 45.1MB in the beginning and 344.8MB in the end (delta: -299.7MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Witness Printer took 99.34ms. Allocated memory is still 419.4MB. Free memory was 344.8MB in the beginning and 336.6MB in the end (delta: 8.2MB). 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: 21]: 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, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 70 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 10 mSDtfsCounter, 70 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=3, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 34 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 57 ConstructedInterpolants, 22 QuantifiedInterpolants, 10725 SizeOfPredicates, 32 NumberOfNonLiveVariables, 364 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 18/48 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: 93]: Location Invariant Derived location invariant: (((((0 == var_7) && (0 == state_8)) && (0 == var_12)) && (1 == mask_SORT_1)) || ((((0 == var_7) && (0 == state_14)) && (0 == var_12)) && (1 == mask_SORT_1))) RESULT: Ultimate proved your program to be correct! [2025-02-08 00:09:27,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE