./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.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.vis_QF_BV_bcuvis32.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 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:11:22,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:11:23,009 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:11:23,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:11:23,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:11:23,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:11:23,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:11:23,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:11:23,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:11:23,030 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:11:23,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:11:23,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:11:23,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:11:23,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:11:23,032 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:11:23,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:11:23,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:11:23,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:11:23,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:11:23,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:11:23,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:11:23,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:11:23,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:11:23,033 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:11:23,033 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:11:23,033 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:11:23,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:11:23,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:11:23,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:11:23,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:11:23,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:11:23,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:11:23,034 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:11:23,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:11:23,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:11:23,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:11:23,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:11:23,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:11:23,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:11:23,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:11:23,034 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 -> 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 [2025-02-05 20:11:23,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:11:23,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:11:23,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:11:23,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:11:23,284 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:11:23,285 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.vis_QF_BV_bcuvis32.c [2025-02-05 20:11:24,523 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46688b564/cdab97c9685047c6ac13d0c1fa908814/FLAGe71108254 [2025-02-05 20:11:24,778 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:11:24,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2025-02-05 20:11:24,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46688b564/cdab97c9685047c6ac13d0c1fa908814/FLAGe71108254 [2025-02-05 20:11:24,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46688b564/cdab97c9685047c6ac13d0c1fa908814 [2025-02-05 20:11:24,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:11:24,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:11:24,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:11:24,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:11:24,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:11:24,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:11:24" (1/1) ... [2025-02-05 20:11:24,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4294bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:24, skipping insertion in model container [2025-02-05 20:11:24,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:11:24" (1/1) ... [2025-02-05 20:11:24,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:11:24,947 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.vis_QF_BV_bcuvis32.c[1258,1271] [2025-02-05 20:11:25,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:11:25,055 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:11:25,065 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.vis_QF_BV_bcuvis32.c[1258,1271] [2025-02-05 20:11:25,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:11:25,145 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:11:25,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:25 WrapperNode [2025-02-05 20:11:25,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:11:25,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:11:25,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:11:25,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:11:25,152 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:11:25" (1/1) ... [2025-02-05 20:11:25,168 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:11:25" (1/1) ... [2025-02-05 20:11:25,242 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 617 [2025-02-05 20:11:25,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:11:25,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:11:25,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:11:25,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:11:25,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:25" (1/1) ... [2025-02-05 20:11:25,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:25" (1/1) ... [2025-02-05 20:11:25,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:25" (1/1) ... [2025-02-05 20:11:25,298 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:11:25,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:25" (1/1) ... [2025-02-05 20:11:25,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:25" (1/1) ... [2025-02-05 20:11:25,323 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:25" (1/1) ... [2025-02-05 20:11:25,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:25" (1/1) ... [2025-02-05 20:11:25,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:25" (1/1) ... [2025-02-05 20:11:25,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:25" (1/1) ... [2025-02-05 20:11:25,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:11:25,355 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:11:25,355 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:11:25,355 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:11:25,356 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:25" (1/1) ... [2025-02-05 20:11:25,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:11:25,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:11:25,385 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:11:25,388 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:11:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:11:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:11:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:11:25,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:11:25,542 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:11:25,543 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:11:26,214 INFO L? ?]: Removed 316 outVars from TransFormulas that were not future-live. [2025-02-05 20:11:26,215 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:11:26,246 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:11:26,248 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:11:26,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:11:26 BoogieIcfgContainer [2025-02-05 20:11:26,248 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:11:26,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:11:26,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:11:26,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:11:26,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:11:24" (1/3) ... [2025-02-05 20:11:26,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e488b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:11:26, skipping insertion in model container [2025-02-05 20:11:26,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:25" (2/3) ... [2025-02-05 20:11:26,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e488b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:11:26, skipping insertion in model container [2025-02-05 20:11:26,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:11:26" (3/3) ... [2025-02-05 20:11:26,257 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2025-02-05 20:11:26,270 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:11:26,271 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_bcuvis32.c that has 1 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:11:26,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:11:26,321 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;@59ec99ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:11:26,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:11:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:26,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 20:11:26,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:26,329 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:11:26,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:26,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:26,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1217743041, now seen corresponding path program 1 times [2025-02-05 20:11:26,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:26,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713588340] [2025-02-05 20:11:26,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:26,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:26,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 20:11:26,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 20:11:26,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:26,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:26,874 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:11:26,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713588340] [2025-02-05 20:11:26,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713588340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:26,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:26,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:11:26,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928903246] [2025-02-05 20:11:26,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:26,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:11:26,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:26,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:11:26,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:11:26,900 INFO L87 Difference]: Start difference. First operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:11:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:27,008 INFO L93 Difference]: Finished difference Result 193 states and 285 transitions. [2025-02-05 20:11:27,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:11:27,014 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:11:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:27,020 INFO L225 Difference]: With dead ends: 193 [2025-02-05 20:11:27,021 INFO L226 Difference]: Without dead ends: 117 [2025-02-05 20:11:27,025 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:11:27,027 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:27,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:11:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-05 20:11:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-05 20:11:27,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 116 states have internal predecessors, (171), 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:11:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2025-02-05 20:11:27,064 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 39 [2025-02-05 20:11:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:27,065 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2025-02-05 20:11:27,065 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:11:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2025-02-05 20:11:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 20:11:27,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:27,067 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:11:27,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:11:27,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:27,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash -899992178, now seen corresponding path program 1 times [2025-02-05 20:11:27,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:27,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723490787] [2025-02-05 20:11:27,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:27,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:27,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 20:11:27,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 20:11:27,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:27,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:27,268 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:11:27,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:27,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723490787] [2025-02-05 20:11:27,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723490787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:27,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:27,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:11:27,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509180690] [2025-02-05 20:11:27,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:27,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:11:27,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:27,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:11:27,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:11:27,274 INFO L87 Difference]: Start difference. First operand 117 states and 171 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:11:27,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:27,381 INFO L93 Difference]: Finished difference Result 194 states and 283 transitions. [2025-02-05 20:11:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:11:27,382 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:11:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:27,383 INFO L225 Difference]: With dead ends: 194 [2025-02-05 20:11:27,383 INFO L226 Difference]: Without dead ends: 119 [2025-02-05 20:11:27,383 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:11:27,384 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:27,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 412 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:11:27,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-05 20:11:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-05 20:11:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2025-02-05 20:11:27,392 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 40 [2025-02-05 20:11:27,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:27,393 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2025-02-05 20:11:27,393 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:11:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2025-02-05 20:11:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 20:11:27,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:27,395 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:11:27,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:11:27,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:27,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:27,396 INFO L85 PathProgramCache]: Analyzing trace with hash -198444452, now seen corresponding path program 1 times [2025-02-05 20:11:27,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:27,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840347104] [2025-02-05 20:11:27,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:27,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:27,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 20:11:27,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 20:11:27,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:27,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:28,106 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:11:28,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:28,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840347104] [2025-02-05 20:11:28,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840347104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:28,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:28,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:11:28,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301968458] [2025-02-05 20:11:28,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:28,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:11:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:28,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:11:28,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:11:28,107 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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:11:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:28,459 INFO L93 Difference]: Finished difference Result 273 states and 395 transitions. [2025-02-05 20:11:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:11:28,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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:11:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:28,462 INFO L225 Difference]: With dead ends: 273 [2025-02-05 20:11:28,462 INFO L226 Difference]: Without dead ends: 196 [2025-02-05 20:11:28,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:11:28,463 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 352 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:28,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 633 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:11:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-05 20:11:28,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2025-02-05 20:11:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.460431654676259) internal successors, (203), 139 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:11:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 203 transitions. [2025-02-05 20:11:28,472 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 203 transitions. Word has length 41 [2025-02-05 20:11:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:28,472 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 203 transitions. [2025-02-05 20:11:28,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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:11:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 203 transitions. [2025-02-05 20:11:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 20:11:28,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:28,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, 1] [2025-02-05 20:11:28,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:11:28,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:28,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash 31551859, now seen corresponding path program 1 times [2025-02-05 20:11:28,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:28,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007608836] [2025-02-05 20:11:28,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:28,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:28,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 20:11:28,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 20:11:28,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:28,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:28,687 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:11:28,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007608836] [2025-02-05 20:11:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007608836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:28,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:28,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:11:28,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800041951] [2025-02-05 20:11:28,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:28,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:11:28,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:28,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:11:28,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:11:28,690 INFO L87 Difference]: Start difference. First operand 140 states and 203 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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:11:28,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:28,817 INFO L93 Difference]: Finished difference Result 221 states and 320 transitions. [2025-02-05 20:11:28,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:11:28,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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:11:28,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:28,818 INFO L225 Difference]: With dead ends: 221 [2025-02-05 20:11:28,819 INFO L226 Difference]: Without dead ends: 144 [2025-02-05 20:11:28,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:11:28,819 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 137 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:28,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 519 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:11:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-05 20:11:28,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2025-02-05 20:11:28,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.460431654676259) internal successors, (203), 139 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:11:28,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 203 transitions. [2025-02-05 20:11:28,825 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 203 transitions. Word has length 42 [2025-02-05 20:11:28,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:28,825 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 203 transitions. [2025-02-05 20:11:28,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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:11:28,825 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 203 transitions. [2025-02-05 20:11:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 20:11:28,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:28,826 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:11:28,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:11:28,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:28,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:28,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1325461528, now seen corresponding path program 1 times [2025-02-05 20:11:28,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:28,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127176239] [2025-02-05 20:11:28,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:28,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:28,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 20:11:28,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 20:11:28,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:28,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:11:28,849 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:11:28,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 20:11:28,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 20:11:28,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:28,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:11:28,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:11:28,906 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:11:28,907 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:11:28,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:11:28,911 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-05 20:11:28,945 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 20:11:28,959 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:11:28,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:11:28 BoogieIcfgContainer [2025-02-05 20:11:28,962 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:11:28,962 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:11:28,962 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:11:28,962 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:11:28,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:11:26" (3/4) ... [2025-02-05 20:11:28,965 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:11:28,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:11:28,968 INFO L158 Benchmark]: Toolchain (without parser) took 4165.59ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 106.5MB in the beginning and 188.1MB in the end (delta: -81.6MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2025-02-05 20:11:28,968 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:11:28,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.09ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 86.4MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:11:28,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.91ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 75.5MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:11:28,969 INFO L158 Benchmark]: Boogie Preprocessor took 110.99ms. Allocated memory is still 142.6MB. Free memory was 75.5MB in the beginning and 68.0MB in the end (delta: 7.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:11:28,969 INFO L158 Benchmark]: IcfgBuilder took 893.59ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 62.9MB in the end (delta: 5.1MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2025-02-05 20:11:28,970 INFO L158 Benchmark]: TraceAbstraction took 2711.75ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 62.9MB in the beginning and 188.1MB in the end (delta: -125.2MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2025-02-05 20:11:28,970 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 302.0MB. Free memory is still 188.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:11:28,971 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.27ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.09ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 86.4MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.91ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 75.5MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.99ms. Allocated memory is still 142.6MB. Free memory was 75.5MB in the beginning and 68.0MB in the end (delta: 7.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 893.59ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 62.9MB in the end (delta: 5.1MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2711.75ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 62.9MB in the beginning and 188.1MB in the end (delta: -125.2MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 302.0MB. Free memory is still 188.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 149. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 32); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (32 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 2); [L33] const SORT_16 msb_SORT_16 = (SORT_16)1 << (2 - 1); [L35] const SORT_59 mask_SORT_59 = (SORT_59)-1 >> (sizeof(SORT_59) * 8 - 3); [L36] const SORT_59 msb_SORT_59 = (SORT_59)1 << (3 - 1); [L38] const SORT_16 var_17 = 0; [L39] const SORT_16 var_20 = 3; [L40] const SORT_3 var_22 = 1; [L41] const SORT_3 var_36 = 0; [L42] const SORT_16 var_77 = 2; [L43] const SORT_16 var_80 = 1; [L44] const SORT_59 var_92 = 0; [L46] SORT_1 input_2; [L47] SORT_3 input_4; [L48] SORT_1 input_5; [L49] SORT_3 input_6; [L50] SORT_3 input_7; [L51] SORT_3 input_8; [L52] SORT_1 input_9; [L53] SORT_3 input_10; [L54] SORT_3 input_11; [L55] SORT_1 input_12; [L56] SORT_3 input_13; [L57] SORT_3 input_14; [L58] SORT_3 input_15; [L59] SORT_1 input_32; [L60] SORT_3 input_34; [L61] SORT_1 input_39; [L62] SORT_3 input_41; [L63] SORT_1 input_47; [L64] SORT_1 input_53; [L65] SORT_1 input_55; [L66] SORT_1 input_57; [L67] SORT_59 input_60; [L68] SORT_59 input_66; [L69] SORT_1 input_69; [L70] SORT_3 input_73; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_16 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L72] SORT_16 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_16; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L73] SORT_3 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L74] SORT_3 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L75] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L76] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L77] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L78] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L79] SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L80] SORT_3 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L81] SORT_3 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] SORT_16 init_19_arg_1 = var_17; [L84] state_18 = init_19_arg_1 [L85] SORT_3 init_24_arg_1 = var_22; [L86] state_23 = init_24_arg_1 [L87] SORT_3 init_38_arg_1 = var_36; [L88] state_37 = init_38_arg_1 [L89] SORT_3 init_44_arg_1 = var_36; [L90] state_43 = init_44_arg_1 [L91] SORT_3 init_46_arg_1 = var_36; [L92] state_45 = init_46_arg_1 [L93] SORT_3 init_50_arg_1 = var_36; [L94] state_49 = init_50_arg_1 [L95] SORT_3 init_52_arg_1 = var_36; [L96] state_51 = init_52_arg_1 [L97] SORT_3 init_63_arg_1 = var_36; [L98] state_62 = init_63_arg_1 [L99] SORT_3 init_65_arg_1 = var_36; [L100] state_64 = init_65_arg_1 [L101] SORT_3 init_72_arg_1 = var_36; [L102] state_71 = init_72_arg_1 VAL [mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L105] input_2 = __VERIFIER_nondet_uint() [L106] input_4 = __VERIFIER_nondet_uchar() [L107] input_5 = __VERIFIER_nondet_uint() [L108] input_6 = __VERIFIER_nondet_uchar() [L109] input_7 = __VERIFIER_nondet_uchar() [L110] EXPR input_7 & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L110] input_7 = input_7 & mask_SORT_3 [L111] input_8 = __VERIFIER_nondet_uchar() [L112] EXPR input_8 & mask_SORT_3 VAL [input_7=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L112] input_8 = input_8 & mask_SORT_3 [L113] input_9 = __VERIFIER_nondet_uint() [L114] input_10 = __VERIFIER_nondet_uchar() [L115] EXPR input_10 & mask_SORT_3 VAL [input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L115] input_10 = input_10 & mask_SORT_3 [L116] input_11 = __VERIFIER_nondet_uchar() [L117] EXPR input_11 & mask_SORT_3 VAL [input_10=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L117] input_11 = input_11 & mask_SORT_3 [L118] input_12 = __VERIFIER_nondet_uint() [L119] input_13 = __VERIFIER_nondet_uchar() [L120] input_14 = __VERIFIER_nondet_uchar() [L121] input_15 = __VERIFIER_nondet_uchar() [L122] input_32 = __VERIFIER_nondet_uint() [L123] input_34 = __VERIFIER_nondet_uchar() [L124] input_39 = __VERIFIER_nondet_uint() [L125] input_41 = __VERIFIER_nondet_uchar() [L126] input_47 = __VERIFIER_nondet_uint() [L127] input_53 = __VERIFIER_nondet_uint() [L128] input_55 = __VERIFIER_nondet_uint() [L129] input_57 = __VERIFIER_nondet_uint() [L130] input_60 = __VERIFIER_nondet_uchar() [L131] input_66 = __VERIFIER_nondet_uchar() [L132] input_69 = __VERIFIER_nondet_uint() [L133] input_73 = __VERIFIER_nondet_uchar() [L136] SORT_16 var_21_arg_0 = state_18; [L137] SORT_16 var_21_arg_1 = var_20; [L138] SORT_3 var_21 = var_21_arg_0 != var_21_arg_1; [L139] SORT_3 var_25_arg_0 = state_23; [L140] SORT_3 var_25_arg_1 = var_22; [L141] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L142] SORT_3 var_26_arg_0 = var_21; [L143] SORT_3 var_26_arg_1 = var_25; VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_26_arg_0=1, var_26_arg_1=1, var_36=0, var_77=2, var_80=1, var_92=0] [L144] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L144] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L145] SORT_3 var_29_arg_0 = var_26; [L146] SORT_3 var_29 = ~var_29_arg_0; [L147] SORT_3 var_30_arg_0 = var_22; [L148] SORT_3 var_30_arg_1 = var_29; VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_30_arg_0=1, var_30_arg_1=-2, var_36=0, var_77=2, var_80=1, var_92=0] [L149] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L149] SORT_3 var_30 = var_30_arg_0 & var_30_arg_1; [L150] EXPR var_30 & mask_SORT_3 VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L150] var_30 = var_30 & mask_SORT_3 [L151] SORT_3 bad_31_arg_0 = var_30; [L152] CALL __VERIFIER_assert(!(bad_31_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 489 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 489 mSDsluCounter, 1979 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1440 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 564 IncrementalHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 539 mSDtfsCounter, 564 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=3, InterpolantAutomatonStates: 21, 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, 60 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 581 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:11:28,987 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.vis_QF_BV_bcuvis32.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 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:11:31,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:11:31,126 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:11:31,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:11:31,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:11:31,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:11:31,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:11:31,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:11:31,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:11:31,154 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:11:31,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:11:31,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:11:31,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:11:31,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:11:31,154 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:11:31,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:11:31,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:11:31,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:11:31,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:11:31,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:11:31,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:11:31,154 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:11:31,154 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:11:31,155 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:11:31,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:11:31,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:11:31,156 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 -> 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 [2025-02-05 20:11:31,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:11:31,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:11:31,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:11:31,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:11:31,437 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:11:31,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.vis_QF_BV_bcuvis32.c [2025-02-05 20:11:32,573 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87722804e/2d5e6cfa432048c78f2d2e9685d3623d/FLAG98e31d777 [2025-02-05 20:11:32,805 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:11:32,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2025-02-05 20:11:32,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87722804e/2d5e6cfa432048c78f2d2e9685d3623d/FLAG98e31d777 [2025-02-05 20:11:32,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87722804e/2d5e6cfa432048c78f2d2e9685d3623d [2025-02-05 20:11:32,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:11:32,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:11:32,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:11:32,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:11:32,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:11:32,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:11:32" (1/1) ... [2025-02-05 20:11:32,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abcadc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:32, skipping insertion in model container [2025-02-05 20:11:32,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:11:32" (1/1) ... [2025-02-05 20:11:32,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:11:32,956 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.vis_QF_BV_bcuvis32.c[1258,1271] [2025-02-05 20:11:33,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:11:33,018 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:11:33,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c[1258,1271] [2025-02-05 20:11:33,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:11:33,093 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:11:33,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:33 WrapperNode [2025-02-05 20:11:33,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:11:33,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:11:33,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:11:33,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:11:33,099 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:11:33" (1/1) ... [2025-02-05 20:11:33,108 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:11:33" (1/1) ... [2025-02-05 20:11:33,138 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 401 [2025-02-05 20:11:33,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:11:33,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:11:33,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:11:33,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:11:33,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:33" (1/1) ... [2025-02-05 20:11:33,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:33" (1/1) ... [2025-02-05 20:11:33,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:33" (1/1) ... [2025-02-05 20:11:33,161 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:11:33,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:33" (1/1) ... [2025-02-05 20:11:33,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:33" (1/1) ... [2025-02-05 20:11:33,168 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:33" (1/1) ... [2025-02-05 20:11:33,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:33" (1/1) ... [2025-02-05 20:11:33,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:33" (1/1) ... [2025-02-05 20:11:33,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:33" (1/1) ... [2025-02-05 20:11:33,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:11:33,175 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:11:33,175 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:11:33,175 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:11:33,176 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:33" (1/1) ... [2025-02-05 20:11:33,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:11:33,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:11:33,210 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:11:33,213 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:11:33,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:11:33,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:11:33,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:11:33,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:11:33,348 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:11:33,349 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:11:33,670 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-02-05 20:11:33,670 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:11:33,678 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:11:33,679 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:11:33,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:11:33 BoogieIcfgContainer [2025-02-05 20:11:33,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:11:33,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:11:33,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:11:33,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:11:33,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:11:32" (1/3) ... [2025-02-05 20:11:33,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652a2095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:11:33, skipping insertion in model container [2025-02-05 20:11:33,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:33" (2/3) ... [2025-02-05 20:11:33,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652a2095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:11:33, skipping insertion in model container [2025-02-05 20:11:33,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:11:33" (3/3) ... [2025-02-05 20:11:33,688 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2025-02-05 20:11:33,698 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:11:33,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_bcuvis32.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:11:33,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:11:33,745 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;@2d8e954f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:11:33,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:11:33,748 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:11:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 20:11:33,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:33,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 20:11:33,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:33,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 20:11:33,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:11:33,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358118904] [2025-02-05 20:11:33,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:33,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:11:33,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:11:33,767 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:11:33,769 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:11:33,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 20:11:33,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 20:11:33,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:33,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:33,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 20:11:33,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:11:34,042 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:11:34,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:11:34,043 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:11:34,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358118904] [2025-02-05 20:11:34,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358118904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:34,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:34,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:11:34,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247307120] [2025-02-05 20:11:34,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:34,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:11:34,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:11:34,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:11:34,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:11:34,061 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:11:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:34,110 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-05 20:11:34,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:11:34,114 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:11:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:34,119 INFO L225 Difference]: With dead ends: 18 [2025-02-05 20:11:34,119 INFO L226 Difference]: Without dead ends: 10 [2025-02-05 20:11:34,121 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:11:34,125 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:11:34,126 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:11:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-05 20:11:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-05 20:11:34,140 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:11:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 20:11:34,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 20:11:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:34,144 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 20:11:34,144 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:11:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 20:11:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 20:11:34,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:34,144 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 20:11:34,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:11:34,345 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:11:34,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:34,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:34,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 20:11:34,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:11:34,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228139419] [2025-02-05 20:11:34,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:34,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:11:34,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:11:34,348 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:11:34,350 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:11:34,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 20:11:34,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 20:11:34,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:34,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:34,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-05 20:11:34,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:11:35,117 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:11:35,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:11:37,986 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:11:37,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:11:37,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228139419] [2025-02-05 20:11:37,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228139419] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:11:37,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:11:37,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-05 20:11:37,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144770083] [2025-02-05 20:11:37,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:11:37,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:11:37,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:11:37,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:11:37,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:11:37,989 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:11:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:38,064 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-02-05 20:11:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:11:38,065 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:11:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:38,065 INFO L225 Difference]: With dead ends: 15 [2025-02-05 20:11:38,065 INFO L226 Difference]: Without dead ends: 13 [2025-02-05 20:11:38,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:11:38,066 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:38,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:11:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-05 20:11:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-02-05 20:11:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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:11:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-02-05 20:11:38,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-02-05 20:11:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:38,071 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-02-05 20:11:38,071 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:11:38,071 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-02-05 20:11:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 20:11:38,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:38,071 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-02-05 20:11:38,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 20:11:38,276 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:11:38,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:38,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:38,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-02-05 20:11:38,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:11:38,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [586196881] [2025-02-05 20:11:38,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 20:11:38,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:11:38,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:11:38,279 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:11:38,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 20:11:38,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-05 20:11:38,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 20:11:38,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 20:11:38,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:38,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 20:11:38,419 INFO L279 TraceCheckSpWp]: Computing forward predicates...