./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.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 0566765eaff6c3202082c0158f35b834bab7b3ce60f20a1eebf1eb36cc13f11e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:15:11,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:15:11,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:15:11,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:15:11,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:15:12,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:15:12,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:15:12,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:15:12,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:15:12,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:15:12,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:15:12,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:15:12,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:15:12,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:15:12,018 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:15:12,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:15:12,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:15:12,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:15:12,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:15:12,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:15:12,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:15:12,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:15:12,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:15:12,018 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:15:12,018 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:15:12,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:15:12,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:15:12,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:15:12,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:15:12,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:12,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:15:12,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:15:12,019 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:15:12,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:15:12,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:15:12,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:15:12,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:15:12,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:15:12,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:15:12,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:15:12,019 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 -> 0566765eaff6c3202082c0158f35b834bab7b3ce60f20a1eebf1eb36cc13f11e [2025-02-08 00:15:12,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:15:12,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:15:12,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:15:12,241 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:15:12,241 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:15:12,243 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_arrays_vsaR_p05.c [2025-02-08 00:15:13,339 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42228b0aa/94e64d2ceea640afacc749968abf3bd5/FLAGddabe75fe [2025-02-08 00:15:13,658 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:15:13,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.c [2025-02-08 00:15:13,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42228b0aa/94e64d2ceea640afacc749968abf3bd5/FLAGddabe75fe [2025-02-08 00:15:13,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42228b0aa/94e64d2ceea640afacc749968abf3bd5 [2025-02-08 00:15:13,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:15:13,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:15:13,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:13,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:15:13,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:15:13,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:13" (1/1) ... [2025-02-08 00:15:13,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29eb79d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:13, skipping insertion in model container [2025-02-08 00:15:13,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:13" (1/1) ... [2025-02-08 00:15:13,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:15:14,082 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_arrays_vsaR_p05.c[1259,1272] [2025-02-08 00:15:14,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:14,302 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:15:14,311 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_arrays_vsaR_p05.c[1259,1272] [2025-02-08 00:15:14,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:14,402 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:15:14,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:14 WrapperNode [2025-02-08 00:15:14,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:14,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:14,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:15:14,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:15:14,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:14" (1/1) ... [2025-02-08 00:15:14,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:14" (1/1) ... [2025-02-08 00:15:14,625 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2155 [2025-02-08 00:15:14,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:14,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:15:14,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:15:14,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:15:14,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:14" (1/1) ... [2025-02-08 00:15:14,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:14" (1/1) ... [2025-02-08 00:15:14,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:14" (1/1) ... [2025-02-08 00:15:14,731 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:15:14,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:14" (1/1) ... [2025-02-08 00:15:14,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:14" (1/1) ... [2025-02-08 00:15:14,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:14" (1/1) ... [2025-02-08 00:15:14,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:14" (1/1) ... [2025-02-08 00:15:14,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:14" (1/1) ... [2025-02-08 00:15:14,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:14" (1/1) ... [2025-02-08 00:15:14,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:15:14,845 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:15:14,845 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:15:14,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:15:14,846 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:14" (1/1) ... [2025-02-08 00:15:14,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:14,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:14,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:15:14,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:15:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:15:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:15:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:15:14,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:15:15,099 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:15:15,101 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:15:16,727 INFO L? ?]: Removed 1341 outVars from TransFormulas that were not future-live. [2025-02-08 00:15:16,729 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:15:16,816 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:15:16,820 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:15:16,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:16 BoogieIcfgContainer [2025-02-08 00:15:16,820 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:15:16,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:15:16,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:15:16,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:15:16,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:15:13" (1/3) ... [2025-02-08 00:15:16,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c9fa76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:16, skipping insertion in model container [2025-02-08 00:15:16,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:14" (2/3) ... [2025-02-08 00:15:16,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c9fa76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:16, skipping insertion in model container [2025-02-08 00:15:16,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:16" (3/3) ... [2025-02-08 00:15:16,828 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p05.c [2025-02-08 00:15:16,840 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:15:16,841 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p05.c that has 1 procedures, 545 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:15:16,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:15:16,907 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;@2a7f82ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:15:16,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:15:16,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 545 states, 543 states have (on average 1.5009208103130756) internal successors, (815), 544 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 00:15:16,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:16,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:16,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:16,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash 640184906, now seen corresponding path program 1 times [2025-02-08 00:15:16,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:16,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724563080] [2025-02-08 00:15:16,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:16,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:16,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 00:15:17,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 00:15:17,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:17,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:17,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:17,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724563080] [2025-02-08 00:15:17,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724563080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:17,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:17,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:17,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478181514] [2025-02-08 00:15:17,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:17,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:17,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:17,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:17,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:17,481 INFO L87 Difference]: Start difference. First operand has 545 states, 543 states have (on average 1.5009208103130756) internal successors, (815), 544 states have internal predecessors, (815), 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 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:17,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:17,794 INFO L93 Difference]: Finished difference Result 1037 states and 1553 transitions. [2025-02-08 00:15:17,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:17,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2025-02-08 00:15:17,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:17,803 INFO L225 Difference]: With dead ends: 1037 [2025-02-08 00:15:17,803 INFO L226 Difference]: Without dead ends: 545 [2025-02-08 00:15:17,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:17,807 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 0 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:17,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2023 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-08 00:15:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-08 00:15:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 544 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 814 transitions. [2025-02-08 00:15:17,847 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 814 transitions. Word has length 44 [2025-02-08 00:15:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:17,847 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 814 transitions. [2025-02-08 00:15:17,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 814 transitions. [2025-02-08 00:15:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 00:15:17,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:17,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:17,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:15:17,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:17,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1624424451, now seen corresponding path program 1 times [2025-02-08 00:15:17,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:17,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699391188] [2025-02-08 00:15:17,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:17,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:17,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 00:15:17,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 00:15:17,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:17,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:18,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:18,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699391188] [2025-02-08 00:15:18,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699391188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:18,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:18,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:18,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268372949] [2025-02-08 00:15:18,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:18,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:18,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:18,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:18,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:18,008 INFO L87 Difference]: Start difference. First operand 545 states and 814 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:18,246 INFO L93 Difference]: Finished difference Result 1039 states and 1552 transitions. [2025-02-08 00:15:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:18,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 45 [2025-02-08 00:15:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:18,248 INFO L225 Difference]: With dead ends: 1039 [2025-02-08 00:15:18,248 INFO L226 Difference]: Without dead ends: 547 [2025-02-08 00:15:18,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:18,250 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 0 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:18,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2020 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:15:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-08 00:15:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-02-08 00:15:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.4945054945054945) internal successors, (816), 546 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 816 transitions. [2025-02-08 00:15:18,263 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 816 transitions. Word has length 45 [2025-02-08 00:15:18,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:18,263 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 816 transitions. [2025-02-08 00:15:18,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 816 transitions. [2025-02-08 00:15:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 00:15:18,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:18,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:18,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:15:18,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:18,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1181007707, now seen corresponding path program 1 times [2025-02-08 00:15:18,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:18,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860339413] [2025-02-08 00:15:18,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:18,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:18,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 00:15:18,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 00:15:18,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:18,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:18,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:18,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860339413] [2025-02-08 00:15:18,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860339413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:18,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:18,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:15:18,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45102133] [2025-02-08 00:15:18,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:18,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:15:18,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:18,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:15:18,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:15:18,770 INFO L87 Difference]: Start difference. First operand 547 states and 816 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:19,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:19,261 INFO L93 Difference]: Finished difference Result 1045 states and 1559 transitions. [2025-02-08 00:15:19,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:15:19,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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 46 [2025-02-08 00:15:19,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:19,264 INFO L225 Difference]: With dead ends: 1045 [2025-02-08 00:15:19,264 INFO L226 Difference]: Without dead ends: 551 [2025-02-08 00:15:19,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:15:19,265 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 782 mSDsluCounter, 3309 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 3973 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:19,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 3973 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:19,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-02-08 00:15:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 550. [2025-02-08 00:15:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.4918032786885247) internal successors, (819), 549 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 819 transitions. [2025-02-08 00:15:19,279 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 819 transitions. Word has length 46 [2025-02-08 00:15:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:19,279 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 819 transitions. [2025-02-08 00:15:19,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 819 transitions. [2025-02-08 00:15:19,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 00:15:19,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:19,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:19,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:15:19,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:19,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:19,284 INFO L85 PathProgramCache]: Analyzing trace with hash 11071715, now seen corresponding path program 1 times [2025-02-08 00:15:19,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:19,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003415575] [2025-02-08 00:15:19,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:19,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:19,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 00:15:19,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 00:15:19,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:19,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:15:19,347 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:15:19,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 00:15:19,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 00:15:19,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:19,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:15:19,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:15:19,438 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:15:19,439 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:15:19,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:15:19,443 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 00:15:19,483 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:15:19,494 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:15:19,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:15:19 BoogieIcfgContainer [2025-02-08 00:15:19,498 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:15:19,499 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:15:19,499 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:15:19,499 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:15:19,499 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:16" (3/4) ... [2025-02-08 00:15:19,501 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:15:19,501 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:15:19,502 INFO L158 Benchmark]: Toolchain (without parser) took 5585.59ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 131.6MB in the beginning and 268.9MB in the end (delta: -137.4MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2025-02-08 00:15:19,503 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:15:19,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.31ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 88.0MB in the end (delta: 43.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 00:15:19,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 221.19ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 87.6MB in the beginning and 110.2MB in the end (delta: -22.6MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. [2025-02-08 00:15:19,504 INFO L158 Benchmark]: Boogie Preprocessor took 217.85ms. Allocated memory is still 176.2MB. Free memory was 110.2MB in the beginning and 89.3MB in the end (delta: 20.8MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2025-02-08 00:15:19,504 INFO L158 Benchmark]: IcfgBuilder took 1975.38ms. Allocated memory was 176.2MB in the beginning and 352.3MB in the end (delta: 176.2MB). Free memory was 89.3MB in the beginning and 117.7MB in the end (delta: -28.4MB). Peak memory consumption was 156.9MB. Max. memory is 16.1GB. [2025-02-08 00:15:19,504 INFO L158 Benchmark]: TraceAbstraction took 2675.73ms. Allocated memory is still 352.3MB. Free memory was 116.7MB in the beginning and 269.0MB in the end (delta: -152.3MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2025-02-08 00:15:19,505 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 352.3MB. Free memory was 269.0MB in the beginning and 268.9MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:15:19,506 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.31ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 88.0MB in the end (delta: 43.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 221.19ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 87.6MB in the beginning and 110.2MB in the end (delta: -22.6MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 217.85ms. Allocated memory is still 176.2MB. Free memory was 110.2MB in the beginning and 89.3MB in the end (delta: 20.8MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1975.38ms. Allocated memory was 176.2MB in the beginning and 352.3MB in the end (delta: 176.2MB). Free memory was 89.3MB in the beginning and 117.7MB in the end (delta: -28.4MB). Peak memory consumption was 156.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2675.73ms. Allocated memory is still 352.3MB. Free memory was 116.7MB in the beginning and 269.0MB in the end (delta: -152.3MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 352.3MB. Free memory was 269.0MB in the beginning and 268.9MB in the end (delta: 44.9kB). 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 175. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 2); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (2 - 1); [L38] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 3); [L39] const SORT_14 msb_SORT_14 = (SORT_14)1 << (3 - 1); [L41] const SORT_96 mask_SORT_96 = (SORT_96)-1 >> (sizeof(SORT_96) * 8 - 4); [L42] const SORT_96 msb_SORT_96 = (SORT_96)1 << (4 - 1); [L44] const SORT_145 mask_SORT_145 = (SORT_145)-1 >> (sizeof(SORT_145) * 8 - 32); [L45] const SORT_145 msb_SORT_145 = (SORT_145)1 << (32 - 1); [L47] const SORT_5 var_7 = 0; [L48] const SORT_14 var_15 = 0; [L49] const SORT_10 var_19 = 0; [L50] const SORT_3 var_21 = 0; [L51] const SORT_1 var_31 = 1; [L52] const SORT_1 var_37 = 0; [L53] const SORT_14 var_55 = 2; [L54] const SORT_14 var_59 = 1; [L55] const SORT_14 var_64 = 4; [L56] const SORT_14 var_66 = 5; [L57] const SORT_14 var_70 = 3; [L58] const SORT_14 var_113 = 7; [L59] const SORT_14 var_118 = 6; [L60] const SORT_145 var_147 = 0; [L61] const SORT_3 var_162 = 2; [L62] const SORT_3 var_184 = 31; [L64] SORT_1 input_2; [L65] SORT_3 input_4; [L66] SORT_5 input_6; [L67] SORT_3 input_173; [L68] SORT_3 input_174; [L69] SORT_3 input_175; [L70] SORT_3 input_183; [L71] SORT_3 input_192; [L72] SORT_3 input_193; [L73] SORT_3 input_194; [L74] SORT_3 input_197; [L75] SORT_3 input_216; [L76] SORT_3 input_217; [L77] SORT_3 input_218; [L78] SORT_3 input_221; [L79] SORT_3 input_223; [L80] SORT_10 input_237; [L81] SORT_10 input_238; [L82] SORT_10 input_239; [L84] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L84] SORT_5 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_14 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L85] SORT_14 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_14; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L86] SORT_3 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L87] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L88] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L89] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L90] SORT_3 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L91] SORT_3 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L92] SORT_3 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L93] SORT_3 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L94] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L95] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L96] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L98] SORT_5 init_9_arg_1 = var_7; [L99] state_8 = init_9_arg_1 [L100] SORT_14 init_17_arg_1 = var_15; [L101] state_16 = init_17_arg_1 [L102] SORT_3 init_23_arg_1 = var_21; [L103] state_22 = init_23_arg_1 [L104] SORT_3 init_25_arg_1 = var_21; [L105] state_24 = init_25_arg_1 [L106] SORT_3 init_36_arg_1 = var_21; [L107] state_35 = init_36_arg_1 [L108] SORT_1 init_39_arg_1 = var_37; [L109] state_38 = init_39_arg_1 [L110] SORT_3 init_41_arg_1 = var_21; [L111] state_40 = init_41_arg_1 [L112] SORT_3 init_43_arg_1 = var_21; [L113] state_42 = init_43_arg_1 [L114] SORT_3 init_45_arg_1 = var_21; [L115] state_44 = init_45_arg_1 [L116] SORT_3 init_47_arg_1 = var_21; [L117] state_46 = init_47_arg_1 [L118] SORT_3 init_49_arg_1 = var_21; [L119] state_48 = init_49_arg_1 [L120] SORT_3 init_51_arg_1 = var_21; [L121] state_50 = init_51_arg_1 [L122] SORT_3 init_53_arg_1 = var_21; [L123] state_52 = init_53_arg_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L126] input_2 = __VERIFIER_nondet_uchar() [L127] input_4 = __VERIFIER_nondet_uchar() [L128] input_6 = __VERIFIER_nondet_ushort() [L129] input_173 = __VERIFIER_nondet_uchar() [L130] input_174 = __VERIFIER_nondet_uchar() [L131] input_175 = __VERIFIER_nondet_uchar() [L132] input_183 = __VERIFIER_nondet_uchar() [L133] input_192 = __VERIFIER_nondet_uchar() [L134] input_193 = __VERIFIER_nondet_uchar() [L135] input_194 = __VERIFIER_nondet_uchar() [L136] input_197 = __VERIFIER_nondet_uchar() [L137] input_216 = __VERIFIER_nondet_uchar() [L138] input_217 = __VERIFIER_nondet_uchar() [L139] input_218 = __VERIFIER_nondet_uchar() [L140] input_221 = __VERIFIER_nondet_uchar() [L141] input_223 = __VERIFIER_nondet_uchar() [L142] input_237 = __VERIFIER_nondet_uchar() [L143] input_238 = __VERIFIER_nondet_uchar() [L144] input_239 = __VERIFIER_nondet_uchar() [L147] SORT_5 var_11_arg_0 = state_8; [L148] SORT_10 var_11 = var_11_arg_0 >> 7; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_11=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L149] EXPR var_11 & mask_SORT_10 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L149] var_11 = var_11 & mask_SORT_10 [L150] SORT_5 var_12_arg_0 = state_8; [L151] SORT_10 var_12 = var_12_arg_0 >> 5; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_11=0, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L152] EXPR var_12 & mask_SORT_10 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_11=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L152] var_12 = var_12 & mask_SORT_10 [L153] SORT_10 var_13_arg_0 = var_11; [L154] SORT_10 var_13_arg_1 = var_12; [L155] SORT_1 var_13 = var_13_arg_0 != var_13_arg_1; [L156] SORT_14 var_18_arg_0 = state_16; [L157] SORT_10 var_18 = var_18_arg_0 >> 1; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_13=0, var_147=0, var_15=0, var_162=2, var_184=31, var_18=0, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L158] EXPR var_18 & mask_SORT_10 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_13=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L158] var_18 = var_18 & mask_SORT_10 [L159] SORT_10 var_20_arg_0 = var_18; [L160] SORT_10 var_20_arg_1 = var_19; [L161] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L162] SORT_3 var_26_arg_0 = state_22; [L163] SORT_3 var_26_arg_1 = state_24; [L164] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L165] SORT_1 var_27_arg_0 = var_20; [L166] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_13=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_27_arg_0=1, var_27_arg_1=1, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L167] EXPR var_27_arg_0 | var_27_arg_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_13=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L167] SORT_1 var_27 = var_27_arg_0 | var_27_arg_1; [L168] SORT_1 var_28_arg_0 = var_13; [L169] SORT_1 var_28_arg_1 = var_27; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_28_arg_0=0, var_28_arg_1=1, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L170] EXPR var_28_arg_0 | var_28_arg_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L170] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L171] SORT_1 var_32_arg_0 = var_28; [L172] SORT_1 var_32 = ~var_32_arg_0; [L173] SORT_1 var_33_arg_0 = var_31; [L174] SORT_1 var_33_arg_1 = var_32; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_33_arg_0=1, var_33_arg_1=-2, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L175] EXPR var_33_arg_0 & var_33_arg_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L175] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L176] EXPR var_33 & mask_SORT_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L176] var_33 = var_33 & mask_SORT_1 [L177] SORT_1 bad_34_arg_0 = var_33; [L178] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 545 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 782 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 782 mSDsluCounter, 8016 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6000 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1716 IncrementalHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 2016 mSDtfsCounter, 1716 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=3, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 00:15:19,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_arrays_vsaR_p05.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 0566765eaff6c3202082c0158f35b834bab7b3ce60f20a1eebf1eb36cc13f11e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:15:21,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:15:21,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:15:21,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:15:21,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:15:21,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:15:21,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:15:21,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:15:21,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:15:21,446 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:15:21,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:15:21,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:15:21,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:15:21,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:15:21,447 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:15:21,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:15:21,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:15:21,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:15:21,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:15:21,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:15:21,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:15:21,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:15:21,448 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:15:21,448 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:15:21,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:15:21,448 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:15:21,448 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:15:21,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:15:21,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:15:21,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:15:21,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:15:21,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:21,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:15:21,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:15:21,449 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:15:21,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:15:21,449 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:15:21,449 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:15:21,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:15:21,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:15:21,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:15:21,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:15:21,449 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 -> 0566765eaff6c3202082c0158f35b834bab7b3ce60f20a1eebf1eb36cc13f11e [2025-02-08 00:15:21,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:15:21,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:15:21,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:15:21,722 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:15:21,722 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:15:21,723 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_arrays_vsaR_p05.c [2025-02-08 00:15:22,939 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a138367e7/ee53c6b728d54214b1643b6260127e8f/FLAGe7d9e9bea [2025-02-08 00:15:23,168 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:15:23,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.c [2025-02-08 00:15:23,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a138367e7/ee53c6b728d54214b1643b6260127e8f/FLAGe7d9e9bea [2025-02-08 00:15:23,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a138367e7/ee53c6b728d54214b1643b6260127e8f [2025-02-08 00:15:23,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:15:23,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:15:23,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:23,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:15:23,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:15:23,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:23" (1/1) ... [2025-02-08 00:15:23,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7013fe13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23, skipping insertion in model container [2025-02-08 00:15:23,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:23" (1/1) ... [2025-02-08 00:15:23,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:15:23,343 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_arrays_vsaR_p05.c[1259,1272] [2025-02-08 00:15:23,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:23,504 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:15:23,512 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_arrays_vsaR_p05.c[1259,1272] [2025-02-08 00:15:23,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:23,605 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:15:23,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23 WrapperNode [2025-02-08 00:15:23,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:23,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:23,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:15:23,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:15:23,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23" (1/1) ... [2025-02-08 00:15:23,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23" (1/1) ... [2025-02-08 00:15:23,705 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1081 [2025-02-08 00:15:23,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:23,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:15:23,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:15:23,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:15:23,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23" (1/1) ... [2025-02-08 00:15:23,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23" (1/1) ... [2025-02-08 00:15:23,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23" (1/1) ... [2025-02-08 00:15:23,755 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:15:23,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23" (1/1) ... [2025-02-08 00:15:23,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23" (1/1) ... [2025-02-08 00:15:23,781 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23" (1/1) ... [2025-02-08 00:15:23,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23" (1/1) ... [2025-02-08 00:15:23,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23" (1/1) ... [2025-02-08 00:15:23,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23" (1/1) ... [2025-02-08 00:15:23,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:15:23,803 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:15:23,803 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:15:23,803 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:15:23,803 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23" (1/1) ... [2025-02-08 00:15:23,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:23,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:23,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:15:23,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:15:23,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:15:23,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:15:23,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:15:23,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:15:24,035 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:15:24,037 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:15:24,966 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2025-02-08 00:15:24,967 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:15:24,973 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:15:24,974 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:15:24,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:24 BoogieIcfgContainer [2025-02-08 00:15:24,974 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:15:24,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:15:24,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:15:24,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:15:24,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:15:23" (1/3) ... [2025-02-08 00:15:24,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791c5bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:24, skipping insertion in model container [2025-02-08 00:15:24,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:23" (2/3) ... [2025-02-08 00:15:24,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791c5bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:24, skipping insertion in model container [2025-02-08 00:15:24,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:24" (3/3) ... [2025-02-08 00:15:24,981 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p05.c [2025-02-08 00:15:24,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:15:24,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p05.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:15:25,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:15:25,032 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;@7050f8bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:15:25,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:15:25,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:25,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:15:25,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:25,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:15:25,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:25,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:15:25,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:15:25,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [921065599] [2025-02-08 00:15:25,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:25,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:25,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:25,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:15:25,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 00:15:25,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:15:25,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:15:25,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:25,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:25,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 00:15:25,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:15:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:25,420 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:15:25,421 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:15:25,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921065599] [2025-02-08 00:15:25,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921065599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:25,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:25,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:15:25,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854146345] [2025-02-08 00:15:25,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:25,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:25,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:15:25,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:25,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:25,440 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:25,505 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-08 00:15:25,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:25,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 00:15:25,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:25,511 INFO L225 Difference]: With dead ends: 16 [2025-02-08 00:15:25,511 INFO L226 Difference]: Without dead ends: 9 [2025-02-08 00:15:25,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:25,515 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:25,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:15:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-08 00:15:25,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-08 00:15:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:15:25,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:15:25,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:25,537 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:15:25,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:15:25,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:15:25,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:25,538 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:15:25,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 00:15:25,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:25,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:25,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:25,740 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:15:25,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:15:25,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173308646] [2025-02-08 00:15:25,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:25,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:25,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:25,743 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:15:25,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 00:15:25,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:15:26,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:15:26,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:26,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:26,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 00:15:26,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:15:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:26,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:15:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:31,572 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:15:31,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173308646] [2025-02-08 00:15:31,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173308646] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:15:31,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:15:31,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-08 00:15:31,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397476556] [2025-02-08 00:15:31,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 00:15:31,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:15:31,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:15:31,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:15:31,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:15:31,575 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:31,726 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-02-08 00:15:31,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:31,727 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 00:15:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:31,727 INFO L225 Difference]: With dead ends: 14 [2025-02-08 00:15:31,727 INFO L226 Difference]: Without dead ends: 12 [2025-02-08 00:15:31,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:15:31,728 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:31,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:15:31,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-08 00:15:31,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-02-08 00:15:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-08 00:15:31,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-08 00:15:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:31,731 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-08 00:15:31,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-08 00:15:31,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 00:15:31,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:31,732 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-08 00:15:31,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 00:15:31,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:31,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:31,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:31,933 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-08 00:15:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:15:31,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758505552] [2025-02-08 00:15:31,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:15:31,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:31,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:31,937 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:15:31,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 00:15:32,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 00:15:32,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 00:15:32,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:15:32,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:32,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-08 00:15:32,239 INFO L279 TraceCheckSpWp]: Computing forward predicates...