./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.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 c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:14:59,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:14:59,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:14:59,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:14:59,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:14:59,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:14:59,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:14:59,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:14:59,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:14:59,313 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:14:59,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:14:59,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:14:59,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:14:59,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:14:59,313 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:14:59,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:14:59,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:14:59,314 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:14:59,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:14:59,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:14:59,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:14:59,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:14:59,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:14:59,314 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:14:59,314 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:14:59,314 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:14:59,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:14:59,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:14:59,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:14:59,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:14:59,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:14:59,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:14:59,315 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:14:59,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:14:59,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:14:59,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:14:59,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:14:59,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:14:59,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:14:59,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:14:59,315 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 -> c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 [2025-02-05 20:14:59,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:14:59,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:14:59,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:14:59,611 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:14:59,611 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:14:59,612 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_p02.c [2025-02-05 20:15:00,933 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b60c87f61/bcd5da4633dd47c8a3745d2271419f1b/FLAGbf14623c1 [2025-02-05 20:15:01,228 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:15:01,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c [2025-02-05 20:15:01,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b60c87f61/bcd5da4633dd47c8a3745d2271419f1b/FLAGbf14623c1 [2025-02-05 20:15:01,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b60c87f61/bcd5da4633dd47c8a3745d2271419f1b [2025-02-05 20:15:01,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:15:01,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:15:01,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:15:01,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:15:01,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:15:01,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:15:01" (1/1) ... [2025-02-05 20:15:01,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c881f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01, skipping insertion in model container [2025-02-05 20:15:01,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:15:01" (1/1) ... [2025-02-05 20:15:01,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:15:01,471 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_p02.c[1259,1272] [2025-02-05 20:15:01,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:15:01,755 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:15:01,765 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_p02.c[1259,1272] [2025-02-05 20:15:01,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:15:01,899 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:15:01,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01 WrapperNode [2025-02-05 20:15:01,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:15:01,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:15:01,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:15:01,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:15:01,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01" (1/1) ... [2025-02-05 20:15:01,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01" (1/1) ... [2025-02-05 20:15:02,213 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2113 [2025-02-05 20:15:02,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:15:02,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:15:02,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:15:02,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:15:02,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01" (1/1) ... [2025-02-05 20:15:02,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01" (1/1) ... [2025-02-05 20:15:02,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01" (1/1) ... [2025-02-05 20:15:02,357 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:15:02,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01" (1/1) ... [2025-02-05 20:15:02,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01" (1/1) ... [2025-02-05 20:15:02,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01" (1/1) ... [2025-02-05 20:15:02,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01" (1/1) ... [2025-02-05 20:15:02,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01" (1/1) ... [2025-02-05 20:15:02,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01" (1/1) ... [2025-02-05 20:15:02,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:15:02,558 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:15:02,558 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:15:02,559 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:15:02,559 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01" (1/1) ... [2025-02-05 20:15:02,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:15:02,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:15:02,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:15:02,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:15:02,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:15:02,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:15:02,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:15:02,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:15:02,897 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:15:02,899 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:15:05,033 INFO L? ?]: Removed 1324 outVars from TransFormulas that were not future-live. [2025-02-05 20:15:05,033 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:15:05,141 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:15:05,141 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:15:05,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:15:05 BoogieIcfgContainer [2025-02-05 20:15:05,141 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:15:05,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:15:05,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:15:05,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:15:05,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:15:01" (1/3) ... [2025-02-05 20:15:05,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c57b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:15:05, skipping insertion in model container [2025-02-05 20:15:05,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:01" (2/3) ... [2025-02-05 20:15:05,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c57b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:15:05, skipping insertion in model container [2025-02-05 20:15:05,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:15:05" (3/3) ... [2025-02-05 20:15:05,179 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c [2025-02-05 20:15:05,194 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:15:05,197 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c that has 1 procedures, 531 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:15:05,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:15:05,272 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;@797f8a82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:15:05,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:15:05,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 531 states, 529 states have (on average 1.4990548204158791) internal successors, (793), 530 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 20:15:05,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:05,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:05,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:05,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:05,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1206475292, now seen corresponding path program 1 times [2025-02-05 20:15:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:05,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061236990] [2025-02-05 20:15:05,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:05,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:05,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 20:15:05,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 20:15:05,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:05,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:06,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:06,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061236990] [2025-02-05 20:15:06,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061236990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:06,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:06,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:15:06,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568780202] [2025-02-05 20:15:06,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:06,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:15:06,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:06,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:15:06,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:15:06,038 INFO L87 Difference]: Start difference. First operand has 531 states, 529 states have (on average 1.4990548204158791) internal successors, (793), 530 states have internal predecessors, (793), 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 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:06,464 INFO L93 Difference]: Finished difference Result 1007 states and 1507 transitions. [2025-02-05 20:15:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:15:06,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-05 20:15:06,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:06,481 INFO L225 Difference]: With dead ends: 1007 [2025-02-05 20:15:06,481 INFO L226 Difference]: Without dead ends: 530 [2025-02-05 20:15:06,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:15:06,490 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 0 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:06,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1966 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:15:06,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-02-05 20:15:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-02-05 20:15:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 1.4952741020793952) internal successors, (791), 529 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 791 transitions. [2025-02-05 20:15:06,563 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 791 transitions. Word has length 41 [2025-02-05 20:15:06,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:06,563 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 791 transitions. [2025-02-05 20:15:06,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:06,565 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 791 transitions. [2025-02-05 20:15:06,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 20:15:06,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:06,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:06,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:15:06,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:06,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:06,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1258651543, now seen corresponding path program 1 times [2025-02-05 20:15:06,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:06,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906734633] [2025-02-05 20:15:06,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:06,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:06,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 20:15:06,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 20:15:06,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:06,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:06,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:06,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906734633] [2025-02-05 20:15:06,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906734633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:06,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:06,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:15:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367864053] [2025-02-05 20:15:06,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:06,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:15:06,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:06,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:15:06,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:15:06,787 INFO L87 Difference]: Start difference. First operand 530 states and 791 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:07,093 INFO L93 Difference]: Finished difference Result 1008 states and 1505 transitions. [2025-02-05 20:15:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:15:07,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-05 20:15:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:07,097 INFO L225 Difference]: With dead ends: 1008 [2025-02-05 20:15:07,097 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 20:15:07,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:15:07,099 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 0 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:07,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1963 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:15:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 20:15:07,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-05 20:15:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 1.4934086629001884) internal successors, (793), 531 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 793 transitions. [2025-02-05 20:15:07,131 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 793 transitions. Word has length 42 [2025-02-05 20:15:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:07,132 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 793 transitions. [2025-02-05 20:15:07,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 793 transitions. [2025-02-05 20:15:07,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 20:15:07,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:07,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:07,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:15:07,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:07,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:07,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1999965121, now seen corresponding path program 1 times [2025-02-05 20:15:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:07,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105872482] [2025-02-05 20:15:07,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:07,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 20:15:07,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 20:15:07,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:07,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:07,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105872482] [2025-02-05 20:15:07,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105872482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:07,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:07,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:15:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017271280] [2025-02-05 20:15:07,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:07,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:15:07,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:07,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:15:07,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:15:07,511 INFO L87 Difference]: Start difference. First operand 532 states and 793 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:07,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:07,886 INFO L93 Difference]: Finished difference Result 1014 states and 1512 transitions. [2025-02-05 20:15:07,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:15:07,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 43 [2025-02-05 20:15:07,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:07,890 INFO L225 Difference]: With dead ends: 1014 [2025-02-05 20:15:07,891 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 20:15:07,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:15:07,892 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 760 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:07,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1956 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:15:07,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 20:15:07,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 535. [2025-02-05 20:15:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.4906367041198503) internal successors, (796), 534 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 796 transitions. [2025-02-05 20:15:07,909 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 796 transitions. Word has length 43 [2025-02-05 20:15:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:07,910 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 796 transitions. [2025-02-05 20:15:07,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:07,910 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 796 transitions. [2025-02-05 20:15:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 20:15:07,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:07,912 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-05 20:15:07,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:15:07,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:07,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:07,915 INFO L85 PathProgramCache]: Analyzing trace with hash 899006027, now seen corresponding path program 1 times [2025-02-05 20:15:07,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:07,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454078489] [2025-02-05 20:15:07,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:07,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:07,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 20:15:07,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 20:15:07,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:07,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:08,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:08,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454078489] [2025-02-05 20:15:08,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454078489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:08,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:08,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:15:08,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670331265] [2025-02-05 20:15:08,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:08,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:15:08,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:08,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:15:08,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:15:08,594 INFO L87 Difference]: Start difference. First operand 535 states and 796 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-05 20:15:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:09,021 INFO L93 Difference]: Finished difference Result 1025 states and 1525 transitions. [2025-02-05 20:15:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:15:09,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-05 20:15:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:09,025 INFO L225 Difference]: With dead ends: 1025 [2025-02-05 20:15:09,026 INFO L226 Difference]: Without dead ends: 544 [2025-02-05 20:15:09,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:15:09,028 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 771 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 2591 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:09,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 2591 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:15:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-02-05 20:15:09,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 539. [2025-02-05 20:15:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.4888475836431228) internal successors, (801), 538 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 801 transitions. [2025-02-05 20:15:09,041 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 801 transitions. Word has length 44 [2025-02-05 20:15:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:09,042 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 801 transitions. [2025-02-05 20:15:09,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-05 20:15:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 801 transitions. [2025-02-05 20:15:09,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 20:15:09,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:09,047 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-05 20:15:09,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:15:09,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:09,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:09,048 INFO L85 PathProgramCache]: Analyzing trace with hash 18986684, now seen corresponding path program 1 times [2025-02-05 20:15:09,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:09,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273377992] [2025-02-05 20:15:09,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:09,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 20:15:09,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 20:15:09,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:09,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:09,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:09,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273377992] [2025-02-05 20:15:09,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273377992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:09,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:09,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:15:09,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604800231] [2025-02-05 20:15:09,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:09,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:15:09,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:09,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:15:09,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:15:09,335 INFO L87 Difference]: Start difference. First operand 539 states and 801 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-05 20:15:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:09,939 INFO L93 Difference]: Finished difference Result 1022 states and 1520 transitions. [2025-02-05 20:15:09,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:15:09,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-05 20:15:09,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:09,942 INFO L225 Difference]: With dead ends: 1022 [2025-02-05 20:15:09,942 INFO L226 Difference]: Without dead ends: 537 [2025-02-05 20:15:09,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:15:09,943 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 751 mSDsluCounter, 2577 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 3224 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:09,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 3224 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:15:09,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-05 20:15:09,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 534. [2025-02-05 20:15:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.4896810506566605) internal successors, (794), 533 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 794 transitions. [2025-02-05 20:15:09,958 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 794 transitions. Word has length 44 [2025-02-05 20:15:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:09,958 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 794 transitions. [2025-02-05 20:15:09,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-05 20:15:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 794 transitions. [2025-02-05 20:15:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 20:15:09,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:09,960 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-05 20:15:09,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:15:09,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:09,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:09,961 INFO L85 PathProgramCache]: Analyzing trace with hash -937997458, now seen corresponding path program 1 times [2025-02-05 20:15:09,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:09,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125435888] [2025-02-05 20:15:09,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:09,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:09,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 20:15:10,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 20:15:10,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:10,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:15:10,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:15:10,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 20:15:10,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 20:15:10,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:10,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:15:10,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:15:10,098 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:15:10,099 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:15:10,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:15:10,103 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-05 20:15:10,155 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 20:15:10,174 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:15:10,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:15:10 BoogieIcfgContainer [2025-02-05 20:15:10,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:15:10,178 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:15:10,178 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:15:10,178 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:15:10,179 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:15:05" (3/4) ... [2025-02-05 20:15:10,181 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:15:10,181 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:15:10,182 INFO L158 Benchmark]: Toolchain (without parser) took 8926.71ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 112.8MB in the beginning and 103.8MB in the end (delta: 9.0MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2025-02-05 20:15:10,184 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:15:10,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 644.95ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 69.6MB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 20:15:10,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 311.94ms. Allocated memory is still 142.6MB. Free memory was 69.6MB in the beginning and 76.4MB in the end (delta: -6.8MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2025-02-05 20:15:10,185 INFO L158 Benchmark]: Boogie Preprocessor took 342.91ms. Allocated memory is still 142.6MB. Free memory was 76.4MB in the beginning and 79.8MB in the end (delta: -3.4MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2025-02-05 20:15:10,185 INFO L158 Benchmark]: IcfgBuilder took 2583.24ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 79.8MB in the beginning and 54.1MB in the end (delta: 25.7MB). Peak memory consumption was 118.8MB. Max. memory is 16.1GB. [2025-02-05 20:15:10,185 INFO L158 Benchmark]: TraceAbstraction took 5030.80ms. Allocated memory is still 234.9MB. Free memory was 54.1MB in the beginning and 103.9MB in the end (delta: -49.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:15:10,185 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 234.9MB. Free memory was 103.9MB in the beginning and 103.8MB in the end (delta: 19.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:15:10,188 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.25ms. Allocated memory is still 201.3MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 644.95ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 69.6MB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 311.94ms. Allocated memory is still 142.6MB. Free memory was 69.6MB in the beginning and 76.4MB in the end (delta: -6.8MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 342.91ms. Allocated memory is still 142.6MB. Free memory was 76.4MB in the beginning and 79.8MB in the end (delta: -3.4MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * IcfgBuilder took 2583.24ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 79.8MB in the beginning and 54.1MB in the end (delta: 25.7MB). Peak memory consumption was 118.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5030.80ms. Allocated memory is still 234.9MB. Free memory was 54.1MB in the beginning and 103.9MB in the end (delta: -49.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 234.9MB. Free memory was 103.9MB in the beginning and 103.8MB in the end (delta: 19.1kB). 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 165. 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_45 mask_SORT_45 = (SORT_45)-1 >> (sizeof(SORT_45) * 8 - 3); [L36] const SORT_45 msb_SORT_45 = (SORT_45)1 << (3 - 1); [L38] const SORT_86 mask_SORT_86 = (SORT_86)-1 >> (sizeof(SORT_86) * 8 - 4); [L39] const SORT_86 msb_SORT_86 = (SORT_86)1 << (4 - 1); [L41] const SORT_143 mask_SORT_143 = (SORT_143)-1 >> (sizeof(SORT_143) * 8 - 32); [L42] const SORT_143 msb_SORT_143 = (SORT_143)1 << (32 - 1); [L44] const SORT_167 mask_SORT_167 = (SORT_167)-1 >> (sizeof(SORT_167) * 8 - 2); [L45] const SORT_167 msb_SORT_167 = (SORT_167)1 << (2 - 1); [L47] const SORT_3 var_7 = 0; [L48] const SORT_1 var_11 = 0; [L49] const SORT_1 var_20 = 1; [L50] const SORT_5 var_32 = 0; [L51] const SORT_45 var_46 = 0; [L52] const SORT_45 var_50 = 2; [L53] const SORT_45 var_54 = 1; [L54] const SORT_45 var_59 = 4; [L55] const SORT_45 var_61 = 5; [L56] const SORT_45 var_65 = 3; [L57] const SORT_3 var_73 = 2; [L58] const SORT_45 var_103 = 7; [L59] const SORT_45 var_108 = 6; [L60] const SORT_143 var_145 = 0; [L61] const SORT_3 var_176 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_164; [L67] SORT_3 input_165; [L68] SORT_3 input_166; [L69] SORT_3 input_175; [L70] SORT_3 input_185; [L71] SORT_3 input_186; [L72] SORT_3 input_187; [L73] SORT_3 input_190; [L74] SORT_3 input_209; [L75] SORT_3 input_210; [L76] SORT_3 input_211; [L77] SORT_3 input_214; [L78] SORT_3 input_216; [L79] SORT_167 input_230; [L80] SORT_167 input_231; [L81] SORT_167 input_232; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L83] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L84] SORT_3 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L85] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L86] SORT_3 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L87] SORT_3 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L88] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L89] SORT_5 state_33 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L90] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L91] SORT_3 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L92] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L93] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L94] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_45 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L95] SORT_45 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_45; [L97] SORT_3 init_9_arg_1 = var_7; [L98] state_8 = init_9_arg_1 [L99] SORT_3 init_14_arg_1 = var_7; [L100] state_13 = init_14_arg_1 [L101] SORT_3 init_25_arg_1 = var_7; [L102] state_24 = init_25_arg_1 [L103] SORT_3 init_27_arg_1 = var_7; [L104] state_26 = init_27_arg_1 [L105] SORT_3 init_29_arg_1 = var_7; [L106] state_28 = init_29_arg_1 [L107] SORT_1 init_31_arg_1 = var_11; [L108] state_30 = init_31_arg_1 [L109] SORT_5 init_34_arg_1 = var_32; [L110] state_33 = init_34_arg_1 [L111] SORT_3 init_36_arg_1 = var_7; [L112] state_35 = init_36_arg_1 [L113] SORT_3 init_38_arg_1 = var_7; [L114] state_37 = init_38_arg_1 [L115] SORT_3 init_40_arg_1 = var_7; [L116] state_39 = init_40_arg_1 [L117] SORT_3 init_42_arg_1 = var_7; [L118] state_41 = init_42_arg_1 [L119] SORT_3 init_44_arg_1 = var_7; [L120] state_43 = init_44_arg_1 [L121] SORT_45 init_48_arg_1 = var_46; [L122] state_47 = init_48_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_164 = __VERIFIER_nondet_uchar() [L129] input_165 = __VERIFIER_nondet_uchar() [L130] input_166 = __VERIFIER_nondet_uchar() [L131] input_175 = __VERIFIER_nondet_uchar() [L132] input_185 = __VERIFIER_nondet_uchar() [L133] input_186 = __VERIFIER_nondet_uchar() [L134] input_187 = __VERIFIER_nondet_uchar() [L135] input_190 = __VERIFIER_nondet_uchar() [L136] input_209 = __VERIFIER_nondet_uchar() [L137] input_210 = __VERIFIER_nondet_uchar() [L138] input_211 = __VERIFIER_nondet_uchar() [L139] input_214 = __VERIFIER_nondet_uchar() [L140] input_216 = __VERIFIER_nondet_uchar() [L141] input_230 = __VERIFIER_nondet_uchar() [L142] input_231 = __VERIFIER_nondet_uchar() [L143] input_232 = __VERIFIER_nondet_uchar() [L146] SORT_3 var_10_arg_0 = state_8; [L147] SORT_1 var_10 = var_10_arg_0 >> 0; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_10=0, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L148] EXPR var_10 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L148] var_10 = var_10 & mask_SORT_1 [L149] SORT_1 var_12_arg_0 = var_10; [L150] SORT_1 var_12_arg_1 = var_11; [L151] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L152] SORT_3 var_15_arg_0 = state_13; [L153] SORT_1 var_15 = var_15_arg_0 >> 0; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_12=1, var_145=0, var_15=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L154] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_12=1, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L154] var_15 = var_15 & mask_SORT_1 [L155] SORT_1 var_16_arg_0 = var_15; [L156] SORT_1 var_16_arg_1 = var_11; [L157] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L158] SORT_1 var_17_arg_0 = var_12; [L159] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_17_arg_0=1, var_17_arg_1=1, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L160] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L160] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L161] SORT_1 var_21_arg_0 = var_17; [L162] SORT_1 var_21 = ~var_21_arg_0; [L163] SORT_1 var_22_arg_0 = var_20; [L164] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_22_arg_0=1, var_22_arg_1=-2, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L165] EXPR var_22_arg_0 & var_22_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L165] SORT_1 var_22 = var_22_arg_0 & var_22_arg_1; [L166] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L166] var_22 = var_22 & mask_SORT_1 [L167] SORT_1 bad_23_arg_0 = var_22; [L168] CALL __VERIFIER_assert(!(bad_23_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 531 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2282 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2282 mSDsluCounter, 11700 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8436 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2481 IncrementalHoareTripleChecker+Invalid, 2485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 3264 mSDtfsCounter, 2481 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=539occurred in iteration=4, InterpolantAutomatonStates: 27, 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, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 520 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 20:15:10,211 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_p02.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 c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:15:12,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:15:12,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-05 20:15:12,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:15:12,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:15:12,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:15:12,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:15:12,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:15:12,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:15:12,605 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:15:12,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:15:12,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:15:12,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:15:12,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:15:12,605 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:15:12,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:15:12,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:15:12,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:15:12,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:15:12,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:15:12,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:15:12,606 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:15:12,606 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:15:12,606 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:15:12,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:15:12,606 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:15:12,607 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:15:12,608 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:15:12,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:15:12,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:15:12,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:15:12,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:15:12,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:15:12,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:15:12,609 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:15:12,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:15:12,609 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:15:12,609 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:15:12,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:15:12,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:15:12,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:15:12,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:15:12,609 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 -> c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 [2025-02-05 20:15:12,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:15:12,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:15:12,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:15:12,927 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:15:12,927 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:15:12,930 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_p02.c [2025-02-05 20:15:14,318 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/969fafeec/0c3807e05ea8426b9b31d28ebb9344f9/FLAGce6cdd207 [2025-02-05 20:15:14,609 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:15:14,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c [2025-02-05 20:15:14,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/969fafeec/0c3807e05ea8426b9b31d28ebb9344f9/FLAGce6cdd207 [2025-02-05 20:15:14,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/969fafeec/0c3807e05ea8426b9b31d28ebb9344f9 [2025-02-05 20:15:14,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:15:14,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:15:14,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:15:14,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:15:14,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:15:14,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:15:14" (1/1) ... [2025-02-05 20:15:14,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a863574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:14, skipping insertion in model container [2025-02-05 20:15:14,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:15:14" (1/1) ... [2025-02-05 20:15:14,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:15:14,857 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_p02.c[1259,1272] [2025-02-05 20:15:15,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:15:15,076 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:15:15,084 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_p02.c[1259,1272] [2025-02-05 20:15:15,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:15:15,201 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:15:15,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:15 WrapperNode [2025-02-05 20:15:15,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:15:15,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:15:15,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:15:15,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:15:15,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:15" (1/1) ... [2025-02-05 20:15:15,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:15" (1/1) ... [2025-02-05 20:15:15,309 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1071 [2025-02-05 20:15:15,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:15:15,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:15:15,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:15:15,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:15:15,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:15" (1/1) ... [2025-02-05 20:15:15,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:15" (1/1) ... [2025-02-05 20:15:15,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:15" (1/1) ... [2025-02-05 20:15:15,390 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:15:15,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:15" (1/1) ... [2025-02-05 20:15:15,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:15" (1/1) ... [2025-02-05 20:15:15,417 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:15" (1/1) ... [2025-02-05 20:15:15,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:15" (1/1) ... [2025-02-05 20:15:15,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:15" (1/1) ... [2025-02-05 20:15:15,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:15" (1/1) ... [2025-02-05 20:15:15,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:15:15,440 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:15:15,444 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:15:15,445 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:15:15,446 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:15" (1/1) ... [2025-02-05 20:15:15,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:15:15,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:15:15,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:15:15,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:15:15,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:15:15,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:15:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:15:15,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:15:15,744 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:15:15,746 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:15:17,004 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-02-05 20:15:17,004 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:15:17,012 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:15:17,012 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:15:17,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:15:17 BoogieIcfgContainer [2025-02-05 20:15:17,013 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:15:17,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:15:17,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:15:17,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:15:17,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:15:14" (1/3) ... [2025-02-05 20:15:17,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:15:17, skipping insertion in model container [2025-02-05 20:15:17,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:15" (2/3) ... [2025-02-05 20:15:17,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:15:17, skipping insertion in model container [2025-02-05 20:15:17,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:15:17" (3/3) ... [2025-02-05 20:15:17,022 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c [2025-02-05 20:15:17,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:15:17,036 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:15:17,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:15:17,088 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;@50eb4227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:15:17,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:15:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:17,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 20:15:17,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:17,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 20:15:17,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:17,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:17,103 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 20:15:17,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:15:17,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015698642] [2025-02-05 20:15:17,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:17,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:15:17,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:15:17,118 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:15:17,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:15:17,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 20:15:17,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 20:15:17,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:17,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:17,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 20:15:17,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:15:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:17,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:15:17,621 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:15:17,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015698642] [2025-02-05 20:15:17,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015698642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:17,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:17,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:15:17,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121517828] [2025-02-05 20:15:17,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:17,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:15:17,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:15:17,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:15:17,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:15:17,646 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:17,732 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-05 20:15:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:15:17,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-05 20:15:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:17,743 INFO L225 Difference]: With dead ends: 18 [2025-02-05 20:15:17,743 INFO L226 Difference]: Without dead ends: 10 [2025-02-05 20:15:17,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:15:17,749 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:17,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:15:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-05 20:15:17,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-05 20:15:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 20:15:17,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 20:15:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:17,773 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 20:15:17,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 20:15:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 20:15:17,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:17,773 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:17,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:15:17,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:15:17,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:17,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:17,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 20:15:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:15:17,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58652827] [2025-02-05 20:15:17,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:17,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:15:17,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:15:17,979 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:15:17,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 20:15:18,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 20:15:18,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 20:15:18,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:18,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:18,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-05 20:15:18,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:15:18,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:18,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:15:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:20,990 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:15:20,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58652827] [2025-02-05 20:15:20,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58652827] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:15:20,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:15:20,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-05 20:15:20,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524424948] [2025-02-05 20:15:20,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:15:20,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:15:20,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:15:20,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:15:20,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:15:20,992 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:21,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:21,246 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-02-05 20:15:21,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:15:21,246 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 20:15:21,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:21,247 INFO L225 Difference]: With dead ends: 15 [2025-02-05 20:15:21,247 INFO L226 Difference]: Without dead ends: 13 [2025-02-05 20:15:21,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:15:21,248 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:21,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:15:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-05 20:15:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-02-05 20:15:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-02-05 20:15:21,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-02-05 20:15:21,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:21,252 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-02-05 20:15:21,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-02-05 20:15:21,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 20:15:21,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:21,252 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-02-05 20:15:21,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 20:15:21,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:15:21,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:21,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:21,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-02-05 20:15:21,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:15:21,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061278517] [2025-02-05 20:15:21,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 20:15:21,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:15:21,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:15:21,461 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:15:21,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 20:15:21,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-05 20:15:21,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 20:15:21,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 20:15:21,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:21,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-05 20:15:21,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:15:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:23,788 INFO L312 TraceCheckSpWp]: Computing backward predicates...