./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_p14.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 6941340a217c21b00eedda9dba2fb93b4ff9d5189cb3951c1318a65ece342f1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:09:53,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:09:53,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:09:53,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:09:53,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:09:53,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:09:53,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:09:53,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:09:53,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:09:53,711 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:09:53,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:09:53,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:09:53,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:09:53,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:09:53,712 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:09:53,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:09:53,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:09:53,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:09:53,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:09:53,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:09:53,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:09:53,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:09:53,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:09:53,713 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:09:53,713 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:09:53,713 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:09:53,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:09:53,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:09:53,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:09:53,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:09:53,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:09:53,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:09:53,714 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:09:53,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:09:53,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:09:53,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:09:53,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:09:53,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:09:53,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:09:53,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:09:53,715 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 -> 6941340a217c21b00eedda9dba2fb93b4ff9d5189cb3951c1318a65ece342f1e [2025-02-05 20:09:53,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:09:53,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:09:53,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:09:53,966 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:09:53,966 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:09:53,968 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_p14.c [2025-02-05 20:09:55,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78912a968/19d0da76c1bb465bb756f265b46582eb/FLAG71c3b2eff [2025-02-05 20:09:55,550 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:09:55,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2025-02-05 20:09:55,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78912a968/19d0da76c1bb465bb756f265b46582eb/FLAG71c3b2eff [2025-02-05 20:09:55,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78912a968/19d0da76c1bb465bb756f265b46582eb [2025-02-05 20:09:55,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:09:55,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:09:55,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:09:55,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:09:55,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:09:55,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:09:55" (1/1) ... [2025-02-05 20:09:55,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffbba88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:55, skipping insertion in model container [2025-02-05 20:09:55,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:09:55" (1/1) ... [2025-02-05 20:09:55,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:09:55,974 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_p14.c[1266,1279] [2025-02-05 20:09:56,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:09:56,058 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:09:56,067 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_p14.c[1266,1279] [2025-02-05 20:09:56,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:09:56,132 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:09:56,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:56 WrapperNode [2025-02-05 20:09:56,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:09:56,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:09:56,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:09:56,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:09:56,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:56" (1/1) ... [2025-02-05 20:09:56,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:56" (1/1) ... [2025-02-05 20:09:56,209 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 705 [2025-02-05 20:09:56,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:09:56,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:09:56,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:09:56,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:09:56,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:56" (1/1) ... [2025-02-05 20:09:56,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:56" (1/1) ... [2025-02-05 20:09:56,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:56" (1/1) ... [2025-02-05 20:09:56,242 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-05 20:09:56,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:56" (1/1) ... [2025-02-05 20:09:56,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:56" (1/1) ... [2025-02-05 20:09:56,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:56" (1/1) ... [2025-02-05 20:09:56,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:56" (1/1) ... [2025-02-05 20:09:56,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:56" (1/1) ... [2025-02-05 20:09:56,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:56" (1/1) ... [2025-02-05 20:09:56,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:09:56,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:09:56,269 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:09:56,269 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:09:56,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:56" (1/1) ... [2025-02-05 20:09:56,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:09:56,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:09:56,291 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-05 20:09:56,293 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-05 20:09:56,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:09:56,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:09:56,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:09:56,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:09:56,426 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:09:56,427 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:09:57,088 INFO L? ?]: Removed 342 outVars from TransFormulas that were not future-live. [2025-02-05 20:09:57,088 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:09:57,125 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:09:57,126 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:09:57,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:09:57 BoogieIcfgContainer [2025-02-05 20:09:57,127 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:09:57,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:09:57,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:09:57,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:09:57,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:09:55" (1/3) ... [2025-02-05 20:09:57,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1140712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:09:57, skipping insertion in model container [2025-02-05 20:09:57,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:09:56" (2/3) ... [2025-02-05 20:09:57,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1140712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:09:57, skipping insertion in model container [2025-02-05 20:09:57,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:09:57" (3/3) ... [2025-02-05 20:09:57,134 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2025-02-05 20:09:57,147 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:09:57,149 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c that has 1 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:09:57,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:09:57,214 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;@1475685f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:09:57,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:09:57,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.4926470588235294) internal successors, (203), 137 states have internal predecessors, (203), 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-05 20:09:57,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 20:09:57,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:57,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:57,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:57,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:57,233 INFO L85 PathProgramCache]: Analyzing trace with hash 71858298, now seen corresponding path program 1 times [2025-02-05 20:09:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:57,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513579898] [2025-02-05 20:09:57,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:57,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:57,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 20:09:57,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 20:09:57,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:57,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:57,987 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-05 20:09:57,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:57,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513579898] [2025-02-05 20:09:57,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513579898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:57,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:57,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:09:57,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509731358] [2025-02-05 20:09:57,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:57,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:09:57,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:58,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:09:58,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:09:58,008 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.4926470588235294) internal successors, (203), 137 states have internal predecessors, (203), 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 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-05 20:09:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:58,133 INFO L93 Difference]: Finished difference Result 223 states and 330 transitions. [2025-02-05 20:09:58,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:09:58,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2025-02-05 20:09:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:58,141 INFO L225 Difference]: With dead ends: 223 [2025-02-05 20:09:58,141 INFO L226 Difference]: Without dead ends: 135 [2025-02-05 20:09:58,143 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-05 20:09:58,145 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 6 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:58,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 477 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:58,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-05 20:09:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-05 20:09:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.4776119402985075) internal successors, (198), 134 states have internal predecessors, (198), 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-05 20:09:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-02-05 20:09:58,169 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 39 [2025-02-05 20:09:58,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:58,169 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-02-05 20:09:58,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-05 20:09:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-02-05 20:09:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 20:09:58,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:58,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:58,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:09:58,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:58,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:58,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2035179810, now seen corresponding path program 1 times [2025-02-05 20:09:58,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:58,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906452409] [2025-02-05 20:09:58,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:58,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:58,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 20:09:58,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 20:09:58,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:58,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:58,363 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-05 20:09:58,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:58,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906452409] [2025-02-05 20:09:58,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906452409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:58,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:58,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:09:58,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239879723] [2025-02-05 20:09:58,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:58,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:09:58,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:58,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:09:58,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:09:58,370 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-05 20:09:58,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:58,460 INFO L93 Difference]: Finished difference Result 139 states and 202 transitions. [2025-02-05 20:09:58,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:09:58,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2025-02-05 20:09:58,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:58,461 INFO L225 Difference]: With dead ends: 139 [2025-02-05 20:09:58,462 INFO L226 Difference]: Without dead ends: 137 [2025-02-05 20:09:58,463 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-05 20:09:58,463 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:58,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-05 20:09:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-05 20:09:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.4705882352941178) internal successors, (200), 136 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:09:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-02-05 20:09:58,472 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 40 [2025-02-05 20:09:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:58,472 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-02-05 20:09:58,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-05 20:09:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-02-05 20:09:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 20:09:58,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:58,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:58,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:09:58,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:58,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1329256080, now seen corresponding path program 1 times [2025-02-05 20:09:58,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:58,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328590103] [2025-02-05 20:09:58,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:58,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:58,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 20:09:58,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 20:09:58,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:58,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:58,580 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-05 20:09:58,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:58,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328590103] [2025-02-05 20:09:58,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328590103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:58,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:58,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:09:58,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002991631] [2025-02-05 20:09:58,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:58,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:09:58,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:58,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:09:58,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:09:58,582 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-05 20:09:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:58,650 INFO L93 Difference]: Finished difference Result 226 states and 329 transitions. [2025-02-05 20:09:58,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:09:58,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2025-02-05 20:09:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:58,651 INFO L225 Difference]: With dead ends: 226 [2025-02-05 20:09:58,651 INFO L226 Difference]: Without dead ends: 139 [2025-02-05 20:09:58,652 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-05 20:09:58,652 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:58,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-05 20:09:58,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-05 20:09:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.463768115942029) internal successors, (202), 138 states have internal predecessors, (202), 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-05 20:09:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-02-05 20:09:58,657 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 41 [2025-02-05 20:09:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:58,657 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-02-05 20:09:58,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-05 20:09:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-02-05 20:09:58,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 20:09:58,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:58,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:58,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:09:58,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:58,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:58,659 INFO L85 PathProgramCache]: Analyzing trace with hash -620723491, now seen corresponding path program 1 times [2025-02-05 20:09:58,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:58,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450690428] [2025-02-05 20:09:58,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:58,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:58,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 20:09:58,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 20:09:58,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:58,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:58,925 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-05 20:09:58,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:58,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450690428] [2025-02-05 20:09:58,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450690428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:58,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:58,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:09:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7531323] [2025-02-05 20:09:58,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:58,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:09:58,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:58,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:09:58,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:09:58,927 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-05 20:09:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:59,016 INFO L93 Difference]: Finished difference Result 232 states and 335 transitions. [2025-02-05 20:09:59,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:59,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 42 [2025-02-05 20:09:59,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:59,017 INFO L225 Difference]: With dead ends: 232 [2025-02-05 20:09:59,017 INFO L226 Difference]: Without dead ends: 143 [2025-02-05 20:09:59,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:59,018 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 173 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:59,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 481 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:09:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-05 20:09:59,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2025-02-05 20:09:59,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.4539007092198581) internal successors, (205), 141 states have internal predecessors, (205), 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-05 20:09:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 205 transitions. [2025-02-05 20:09:59,024 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 205 transitions. Word has length 42 [2025-02-05 20:09:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:59,024 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 205 transitions. [2025-02-05 20:09:59,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-05 20:09:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 205 transitions. [2025-02-05 20:09:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 20:09:59,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:59,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:59,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:09:59,025 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:59,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1509435676, now seen corresponding path program 1 times [2025-02-05 20:09:59,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:59,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766288429] [2025-02-05 20:09:59,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:59,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:59,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 20:09:59,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 20:09:59,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:59,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:09:59,053 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:09:59,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 20:09:59,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 20:09:59,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:59,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:09:59,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:09:59,099 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:09:59,100 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:09:59,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:09:59,104 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-05 20:09:59,136 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 20:09:59,153 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:09:59,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:09:59 BoogieIcfgContainer [2025-02-05 20:09:59,156 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:09:59,157 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:09:59,159 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:09:59,159 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:09:59,160 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:09:57" (3/4) ... [2025-02-05 20:09:59,162 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:09:59,162 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:09:59,163 INFO L158 Benchmark]: Toolchain (without parser) took 3302.21ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 132.6MB in the beginning and 100.9MB in the end (delta: 31.7MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2025-02-05 20:09:59,163 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 226.5MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:09:59,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.70ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 111.9MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:09:59,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.19ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 98.6MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:09:59,165 INFO L158 Benchmark]: Boogie Preprocessor took 58.65ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 91.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:09:59,165 INFO L158 Benchmark]: IcfgBuilder took 858.14ms. Allocated memory is still 167.8MB. Free memory was 91.2MB in the beginning and 91.2MB in the end (delta: 37.3kB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2025-02-05 20:09:59,165 INFO L158 Benchmark]: TraceAbstraction took 2027.15ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 90.3MB in the beginning and 100.9MB in the end (delta: -10.6MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2025-02-05 20:09:59,165 INFO L158 Benchmark]: Witness Printer took 5.53ms. Allocated memory is still 201.3MB. Free memory was 100.9MB in the beginning and 100.9MB in the end (delta: 33.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:09:59,166 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.22ms. Allocated memory is still 226.5MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.70ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 111.9MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.19ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 98.6MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.65ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 91.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 858.14ms. Allocated memory is still 167.8MB. Free memory was 91.2MB in the beginning and 91.2MB in the end (delta: 37.3kB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2027.15ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 90.3MB in the beginning and 100.9MB in the end (delta: -10.6MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * Witness Printer took 5.53ms. Allocated memory is still 201.3MB. Free memory was 100.9MB in the beginning and 100.9MB in the end (delta: 33.0kB). 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 bitwiseOr at line 162. 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_32 mask_SORT_32 = (SORT_32)-1 >> (sizeof(SORT_32) * 8 - 4); [L36] const SORT_32 msb_SORT_32 = (SORT_32)1 << (4 - 1); [L38] const SORT_70 mask_SORT_70 = (SORT_70)-1 >> (sizeof(SORT_70) * 8 - 10); [L39] const SORT_70 msb_SORT_70 = (SORT_70)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_22 = 1; [L44] const SORT_70 var_71 = 0; [L45] const SORT_10 var_95 = 104; [L46] const SORT_10 var_143 = 1; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_1 input_5; [L51] SORT_1 input_6; [L52] SORT_1 input_30; [L53] SORT_32 input_33; [L54] SORT_1 input_35; [L55] SORT_32 input_37; [L56] SORT_1 input_39; [L57] SORT_1 input_41; [L58] SORT_1 input_47; [L59] SORT_1 input_49; [L60] SORT_1 input_51; [L61] SORT_3 input_55; [L62] SORT_1 input_58; [L63] SORT_1 input_66; [L64] SORT_1 input_75; [L65] SORT_1 input_77; [L66] SORT_1 input_89; [L67] SORT_1 input_90; [L68] SORT_1 input_91; [L69] SORT_1 input_105; [L70] SORT_1 input_111; [L71] SORT_1 input_117; [L72] SORT_1 input_123; [L73] SORT_1 input_124; [L74] SORT_1 input_125; [L75] SORT_70 input_141; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L77] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L78] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L79] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L80] SORT_1 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L81] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L82] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L83] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L84] SORT_1 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L85] SORT_1 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L86] SORT_1 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L87] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_ushort() & mask_SORT_70 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L88] SORT_70 state_72 = __VERIFIER_nondet_ushort() & mask_SORT_70; [L90] SORT_1 init_9_arg_1 = var_7; [L91] state_8 = init_9_arg_1 [L92] SORT_1 init_16_arg_1 = var_7; [L93] state_15 = init_16_arg_1 [L94] SORT_1 init_27_arg_1 = var_7; [L95] state_26 = init_27_arg_1 [L96] SORT_1 init_29_arg_1 = var_7; [L97] state_28 = init_29_arg_1 [L98] SORT_1 init_44_arg_1 = var_7; [L99] state_43 = init_44_arg_1 [L100] SORT_1 init_46_arg_1 = var_7; [L101] state_45 = init_46_arg_1 [L102] SORT_1 init_54_arg_1 = var_22; [L103] state_53 = init_54_arg_1 [L104] SORT_1 init_61_arg_1 = var_7; [L105] state_60 = init_61_arg_1 [L106] SORT_1 init_63_arg_1 = var_7; [L107] state_62 = init_63_arg_1 [L108] SORT_1 init_65_arg_1 = var_7; [L109] state_64 = init_65_arg_1 [L110] SORT_1 init_69_arg_1 = var_7; [L111] state_68 = init_69_arg_1 [L112] SORT_70 init_73_arg_1 = var_71; [L113] state_72 = init_73_arg_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L116] input_2 = __VERIFIER_nondet_uchar() [L117] input_4 = __VERIFIER_nondet_uchar() [L118] input_5 = __VERIFIER_nondet_uchar() [L119] input_6 = __VERIFIER_nondet_uchar() [L120] input_30 = __VERIFIER_nondet_uchar() [L121] input_33 = __VERIFIER_nondet_uchar() [L122] input_35 = __VERIFIER_nondet_uchar() [L123] input_37 = __VERIFIER_nondet_uchar() [L124] input_39 = __VERIFIER_nondet_uchar() [L125] input_41 = __VERIFIER_nondet_uchar() [L126] input_47 = __VERIFIER_nondet_uchar() [L127] input_49 = __VERIFIER_nondet_uchar() [L128] input_51 = __VERIFIER_nondet_uchar() [L129] input_55 = __VERIFIER_nondet_uchar() [L130] input_58 = __VERIFIER_nondet_uchar() [L131] input_66 = __VERIFIER_nondet_uchar() [L132] input_75 = __VERIFIER_nondet_uchar() [L133] input_77 = __VERIFIER_nondet_uchar() [L134] input_89 = __VERIFIER_nondet_uchar() [L135] input_90 = __VERIFIER_nondet_uchar() [L136] input_91 = __VERIFIER_nondet_uchar() [L137] input_105 = __VERIFIER_nondet_uchar() [L138] input_111 = __VERIFIER_nondet_uchar() [L139] input_117 = __VERIFIER_nondet_uchar() [L140] input_123 = __VERIFIER_nondet_uchar() [L141] input_124 = __VERIFIER_nondet_uchar() [L142] input_125 = __VERIFIER_nondet_uchar() [L143] input_141 = __VERIFIER_nondet_ushort() [L146] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_11_arg_0=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L147] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L147] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L148] SORT_10 var_11 = var_11_arg_0; [L149] SORT_10 var_13_arg_0 = var_11; [L150] SORT_10 var_13_arg_1 = var_12; [L151] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L152] SORT_1 var_14_arg_0 = var_13; [L153] SORT_1 var_14 = ~var_14_arg_0; [L154] SORT_1 var_17_arg_0 = state_15; VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_14=-2, var_17_arg_0=0, var_22=1, var_71=0, var_7=0, var_95=104] [L155] EXPR var_17_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_14=-2, var_22=1, var_71=0, var_7=0, var_95=104] [L155] var_17_arg_0 = var_17_arg_0 & mask_SORT_1 [L156] SORT_10 var_17 = var_17_arg_0; [L157] SORT_10 var_18_arg_0 = var_17; [L158] SORT_10 var_18_arg_1 = var_12; [L159] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L160] SORT_1 var_19_arg_0 = var_14; [L161] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_19_arg_0=-2, var_19_arg_1=1, var_22=1, var_71=0, var_7=0, var_95=104] [L162] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L162] SORT_1 var_19 = var_19_arg_0 | var_19_arg_1; [L163] SORT_1 var_23_arg_0 = var_19; [L164] SORT_1 var_23 = ~var_23_arg_0; [L165] SORT_1 var_24_arg_0 = var_22; [L166] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_24_arg_0=1, var_24_arg_1=-255, var_71=0, var_7=0, var_95=104] [L167] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L167] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L168] EXPR var_24 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L168] var_24 = var_24 & mask_SORT_1 [L169] SORT_1 bad_25_arg_0 = var_24; [L170] CALL __VERIFIER_assert(!(bad_25_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 179 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 1929 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1277 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 436 IncrementalHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 652 mSDtfsCounter, 436 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=4, InterpolantAutomatonStates: 17, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-05 20:09:59,186 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_p14.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 6941340a217c21b00eedda9dba2fb93b4ff9d5189cb3951c1318a65ece342f1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:10:01,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:10:01,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-05 20:10:01,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:10:01,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:10:01,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:10:01,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:10:01,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:10:01,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:10:01,175 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:10:01,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:10:01,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:10:01,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:10:01,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:10:01,177 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:10:01,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:10:01,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:10:01,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:10:01,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:10:01,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:10:01,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:10:01,179 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:10:01,180 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:10:01,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:10:01,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:10:01,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:10:01,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:10:01,180 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 -> 6941340a217c21b00eedda9dba2fb93b4ff9d5189cb3951c1318a65ece342f1e [2025-02-05 20:10:01,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:10:01,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:10:01,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:10:01,438 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:10:01,438 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:10:01,438 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_p14.c [2025-02-05 20:10:02,682 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0974b5644/44165b6a1de24a69a40a4a8f31de80f4/FLAGcabb4e0ae [2025-02-05 20:10:02,915 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:10:02,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2025-02-05 20:10:02,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0974b5644/44165b6a1de24a69a40a4a8f31de80f4/FLAGcabb4e0ae [2025-02-05 20:10:02,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0974b5644/44165b6a1de24a69a40a4a8f31de80f4 [2025-02-05 20:10:02,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:10:02,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:10:02,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:10:02,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:10:02,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:10:02,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:10:02" (1/1) ... [2025-02-05 20:10:02,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3806e730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:02, skipping insertion in model container [2025-02-05 20:10:02,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:10:02" (1/1) ... [2025-02-05 20:10:02,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:10:03,090 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_p14.c[1266,1279] [2025-02-05 20:10:03,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:10:03,204 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:10:03,215 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_p14.c[1266,1279] [2025-02-05 20:10:03,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:10:03,284 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:10:03,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:03 WrapperNode [2025-02-05 20:10:03,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:10:03,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:10:03,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:10:03,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:10:03,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:03" (1/1) ... [2025-02-05 20:10:03,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:03" (1/1) ... [2025-02-05 20:10:03,334 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 449 [2025-02-05 20:10:03,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:10:03,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:10:03,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:10:03,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:10:03,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:03" (1/1) ... [2025-02-05 20:10:03,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:03" (1/1) ... [2025-02-05 20:10:03,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:03" (1/1) ... [2025-02-05 20:10:03,374 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-05 20:10:03,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:03" (1/1) ... [2025-02-05 20:10:03,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:03" (1/1) ... [2025-02-05 20:10:03,392 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:03" (1/1) ... [2025-02-05 20:10:03,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:03" (1/1) ... [2025-02-05 20:10:03,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:03" (1/1) ... [2025-02-05 20:10:03,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:03" (1/1) ... [2025-02-05 20:10:03,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:10:03,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:10:03,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:10:03,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:10:03,403 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:03" (1/1) ... [2025-02-05 20:10:03,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:10:03,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:03,441 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-05 20:10:03,443 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-05 20:10:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:10:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:10:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:10:03,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:10:03,580 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:10:03,585 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:10:03,814 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-02-05 20:10:03,815 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:10:03,820 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:10:03,820 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:10:03,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:03 BoogieIcfgContainer [2025-02-05 20:10:03,820 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:10:03,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:10:03,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:10:03,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:10:03,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:10:02" (1/3) ... [2025-02-05 20:10:03,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724359fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:10:03, skipping insertion in model container [2025-02-05 20:10:03,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:03" (2/3) ... [2025-02-05 20:10:03,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724359fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:10:03, skipping insertion in model container [2025-02-05 20:10:03,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:03" (3/3) ... [2025-02-05 20:10:03,826 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2025-02-05 20:10:03,836 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:10:03,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:10:03,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:10:03,877 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;@27eb5805, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:10:03,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:10:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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-05 20:10:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 20:10:03,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:03,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 20:10:03,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:03,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:03,886 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 20:10:03,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:10:03,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1137715267] [2025-02-05 20:10:03,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:03,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:10:03,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:03,895 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-05 20:10:03,897 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-05 20:10:03,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 20:10:04,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 20:10:04,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:04,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:04,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 20:10:04,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:10:04,162 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-05 20:10:04,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:10:04,164 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:10:04,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137715267] [2025-02-05 20:10:04,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137715267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:04,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:04,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:10:04,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795436544] [2025-02-05 20:10:04,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:04,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:10:04,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:10:04,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:10:04,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:04,189 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-05 20:10:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:04,234 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-05 20:10:04,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:10:04,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-02-05 20:10:04,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:04,240 INFO L225 Difference]: With dead ends: 18 [2025-02-05 20:10:04,241 INFO L226 Difference]: Without dead ends: 10 [2025-02-05 20:10:04,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-05 20:10:04,245 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 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-05 20:10:04,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:10:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-05 20:10:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-05 20:10:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-05 20:10:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 20:10:04,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 20:10:04,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:04,263 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 20:10:04,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-05 20:10:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 20:10:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 20:10:04,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:04,264 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:04,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:10:04,469 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-05 20:10:04,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:04,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:04,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 20:10:04,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:10:04,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124990765] [2025-02-05 20:10:04,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:04,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:10:04,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:04,474 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-05 20:10:04,476 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-05 20:10:04,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 20:10:04,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 20:10:04,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:04,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:04,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 20:10:04,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:10:04,750 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-05 20:10:04,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:10:05,114 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-05 20:10:05,115 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:10:05,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124990765] [2025-02-05 20:10:05,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124990765] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:10:05,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:10:05,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-05 20:10:05,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196731780] [2025-02-05 20:10:05,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:10:05,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:10:05,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:10:05,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:10:05,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:10:05,117 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-05 20:10:05,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:05,259 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2025-02-05 20:10:05,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:10:05,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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) Word has length 8 [2025-02-05 20:10:05,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:05,260 INFO L225 Difference]: With dead ends: 10 [2025-02-05 20:10:05,260 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 20:10:05,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:10:05,261 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:05,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:10:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 20:10:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 20:10:05,261 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-05 20:10:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 20:10:05,262 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2025-02-05 20:10:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:05,262 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 20:10:05,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-05 20:10:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 20:10:05,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 20:10:05,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:10:05,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 20:10:05,468 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-05 20:10:05,470 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-05 20:10:05,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 20:10:05,509 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:10:05,515 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-02-05 20:10:05,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:10:05 BoogieIcfgContainer [2025-02-05 20:10:05,518 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:10:05,519 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:10:05,519 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:10:05,519 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:10:05,520 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:03" (3/4) ... [2025-02-05 20:10:05,521 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 20:10:05,528 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-05 20:10:05,529 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 20:10:05,529 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 20:10:05,530 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 20:10:05,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 20:10:05,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 20:10:05,594 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:10:05,594 INFO L158 Benchmark]: Toolchain (without parser) took 2650.34ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 91.5MB in the beginning and 73.2MB in the end (delta: 18.3MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2025-02-05 20:10:05,594 INFO L158 Benchmark]: CDTParser took 2.45ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:10:05,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.47ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 71.8MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:10:05,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.26ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 68.5MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:10:05,595 INFO L158 Benchmark]: Boogie Preprocessor took 63.37ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 64.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:10:05,595 INFO L158 Benchmark]: IcfgBuilder took 418.32ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 80.9MB in the end (delta: -16.0MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2025-02-05 20:10:05,595 INFO L158 Benchmark]: TraceAbstraction took 1696.63ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 80.1MB in the beginning and 82.9MB in the end (delta: -2.8MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2025-02-05 20:10:05,596 INFO L158 Benchmark]: Witness Printer took 74.74ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 73.2MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:10:05,596 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.45ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.47ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 71.8MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.26ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 68.5MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.37ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 64.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 418.32ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 80.9MB in the end (delta: -16.0MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1696.63ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 80.1MB in the beginning and 82.9MB in the end (delta: -2.8MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Witness Printer took 74.74ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 73.2MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * 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, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 6 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 10, 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, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 4 QuantifiedInterpolants, 708 SizeOfPredicates, 13 NumberOfNonLiveVariables, 190 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/4 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: 114]: Location Invariant Derived location invariant: (((0 == var_12) && (0 == state_15)) && (1 == mask_SORT_1)) RESULT: Ultimate proved your program to be correct! [2025-02-05 20:10:05,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE