./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.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 e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:36:58,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:36:58,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:36:58,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:36:58,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:36:58,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:36:58,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:36:58,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:36:58,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:36:58,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:36:58,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:36:58,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:36:58,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:36:58,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:36:58,797 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:36:58,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:36:58,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:36:58,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:36:58,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:36:58,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:36:58,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:36:58,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:36:58,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:36:58,798 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:36:58,798 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:36:58,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:36:58,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:36:58,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:36:58,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:36:58,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:36:58,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:36:58,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:36:58,799 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:36:58,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:36:58,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:36:58,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:36:58,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:36:58,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:36:58,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:36:58,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:36:58,799 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 -> e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec [2025-02-07 22:36:58,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:36:59,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:36:59,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:36:59,008 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:36:59,009 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:36:59,009 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.cal2.c [2025-02-07 22:37:00,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb3d6015a/870c0892757c47708b15939ed9fe9989/FLAGf1d215c0e [2025-02-07 22:37:00,533 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:37:00,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c [2025-02-07 22:37:00,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb3d6015a/870c0892757c47708b15939ed9fe9989/FLAGf1d215c0e [2025-02-07 22:37:00,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb3d6015a/870c0892757c47708b15939ed9fe9989 [2025-02-07 22:37:00,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:37:00,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:37:00,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:37:00,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:37:00,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:37:00,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:37:00" (1/1) ... [2025-02-07 22:37:00,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eaa952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:00, skipping insertion in model container [2025-02-07 22:37:00,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:37:00" (1/1) ... [2025-02-07 22:37:00,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:37:00,749 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.cal2.c[1244,1257] [2025-02-07 22:37:00,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:37:00,937 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:37:00,944 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.cal2.c[1244,1257] [2025-02-07 22:37:01,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:37:01,020 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:37:01,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:01 WrapperNode [2025-02-07 22:37:01,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:37:01,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:37:01,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:37:01,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:37:01,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:01" (1/1) ... [2025-02-07 22:37:01,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:01" (1/1) ... [2025-02-07 22:37:01,180 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2327 [2025-02-07 22:37:01,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:37:01,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:37:01,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:37:01,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:37:01,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:01" (1/1) ... [2025-02-07 22:37:01,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:01" (1/1) ... [2025-02-07 22:37:01,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:01" (1/1) ... [2025-02-07 22:37:01,259 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-02-07 22:37:01,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:01" (1/1) ... [2025-02-07 22:37:01,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:01" (1/1) ... [2025-02-07 22:37:01,303 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:01" (1/1) ... [2025-02-07 22:37:01,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:01" (1/1) ... [2025-02-07 22:37:01,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:01" (1/1) ... [2025-02-07 22:37:01,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:01" (1/1) ... [2025-02-07 22:37:01,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:37:01,368 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:37:01,369 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:37:01,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:37:01,369 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:01" (1/1) ... [2025-02-07 22:37:01,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:37:01,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:37:01,395 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-07 22:37:01,398 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-07 22:37:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:37:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:37:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 22:37:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:37:01,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:37:01,687 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:37:01,688 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:37:03,217 INFO L? ?]: Removed 1304 outVars from TransFormulas that were not future-live. [2025-02-07 22:37:03,217 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:37:03,293 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:37:03,296 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:37:03,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:37:03 BoogieIcfgContainer [2025-02-07 22:37:03,296 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:37:03,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:37:03,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:37:03,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:37:03,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:37:00" (1/3) ... [2025-02-07 22:37:03,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505fa916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:37:03, skipping insertion in model container [2025-02-07 22:37:03,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:01" (2/3) ... [2025-02-07 22:37:03,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505fa916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:37:03, skipping insertion in model container [2025-02-07 22:37:03,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:37:03" (3/3) ... [2025-02-07 22:37:03,303 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal2.c [2025-02-07 22:37:03,313 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:37:03,314 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal2.c that has 1 procedures, 508 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:37:03,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:37:03,388 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;@666af536, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:37:03,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:37:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 508 states, 506 states have (on average 1.5118577075098814) internal successors, (765), 507 states have internal predecessors, (765), 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-07 22:37:03,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-07 22:37:03,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:37:03,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:37:03,400 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:37:03,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:37:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash 683914884, now seen corresponding path program 1 times [2025-02-07 22:37:03,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:37:03,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573594958] [2025-02-07 22:37:03,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:37:03,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:37:03,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-07 22:37:03,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-07 22:37:03,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:37:03,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:37:04,058 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-07 22:37:04,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:37:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573594958] [2025-02-07 22:37:04,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573594958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:37:04,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:37:04,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:37:04,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978047123] [2025-02-07 22:37:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:37:04,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:37:04,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:37:04,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:37:04,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:37:04,080 INFO L87 Difference]: Start difference. First operand has 508 states, 506 states have (on average 1.5118577075098814) internal successors, (765), 507 states have internal predecessors, (765), 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 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-07 22:37:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:37:04,372 INFO L93 Difference]: Finished difference Result 895 states and 1351 transitions. [2025-02-07 22:37:04,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:37:04,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2025-02-07 22:37:04,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:37:04,385 INFO L225 Difference]: With dead ends: 895 [2025-02-07 22:37:04,385 INFO L226 Difference]: Without dead ends: 508 [2025-02-07 22:37:04,392 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-07 22:37:04,393 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 0 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1909 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:37:04,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1909 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:37:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-02-07 22:37:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-02-07 22:37:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.5069033530571991) internal successors, (764), 507 states have internal predecessors, (764), 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-07 22:37:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 764 transitions. [2025-02-07 22:37:04,465 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 764 transitions. Word has length 78 [2025-02-07 22:37:04,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:37:04,466 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 764 transitions. [2025-02-07 22:37:04,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-07 22:37:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 764 transitions. [2025-02-07 22:37:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-07 22:37:04,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:37:04,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:37:04,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 22:37:04,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:37:04,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:37:04,472 INFO L85 PathProgramCache]: Analyzing trace with hash -268795314, now seen corresponding path program 1 times [2025-02-07 22:37:04,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:37:04,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995486794] [2025-02-07 22:37:04,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:37:04,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:37:04,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-07 22:37:04,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-07 22:37:04,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:37:04,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:37:04,730 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-07 22:37:04,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:37:04,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995486794] [2025-02-07 22:37:04,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995486794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:37:04,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:37:04,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:37:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342381071] [2025-02-07 22:37:04,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:37:04,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:37:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:37:04,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:37:04,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:37:04,735 INFO L87 Difference]: Start difference. First operand 508 states and 764 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-07 22:37:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:37:04,966 INFO L93 Difference]: Finished difference Result 897 states and 1350 transitions. [2025-02-07 22:37:04,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:37:04,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2025-02-07 22:37:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:37:04,968 INFO L225 Difference]: With dead ends: 897 [2025-02-07 22:37:04,968 INFO L226 Difference]: Without dead ends: 510 [2025-02-07 22:37:04,969 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-07 22:37:04,969 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 0 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:37:04,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1906 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:37:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-02-07 22:37:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-02-07 22:37:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.5049115913555993) internal successors, (766), 509 states have internal predecessors, (766), 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-07 22:37:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 766 transitions. [2025-02-07 22:37:04,991 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 766 transitions. Word has length 79 [2025-02-07 22:37:04,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:37:04,992 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 766 transitions. [2025-02-07 22:37:04,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-07 22:37:04,992 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 766 transitions. [2025-02-07 22:37:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-07 22:37:04,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:37:04,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:37:04,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:37:04,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:37:04,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:37:04,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2106177601, now seen corresponding path program 1 times [2025-02-07 22:37:04,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:37:04,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694909999] [2025-02-07 22:37:04,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:37:04,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:37:05,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-07 22:37:05,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 22:37:05,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:37:05,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:37:05,534 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-07 22:37:05,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:37:05,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694909999] [2025-02-07 22:37:05,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694909999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:37:05,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:37:05,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:37:05,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726125396] [2025-02-07 22:37:05,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:37:05,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:37:05,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:37:05,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:37:05,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:37:05,536 INFO L87 Difference]: Start difference. First operand 510 states and 766 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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-07 22:37:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:37:06,248 INFO L93 Difference]: Finished difference Result 936 states and 1402 transitions. [2025-02-07 22:37:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:37:06,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2025-02-07 22:37:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:37:06,251 INFO L225 Difference]: With dead ends: 936 [2025-02-07 22:37:06,251 INFO L226 Difference]: Without dead ends: 547 [2025-02-07 22:37:06,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:37:06,252 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 799 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2508 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:37:06,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2508 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:37:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-07 22:37:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 528. [2025-02-07 22:37:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.5028462998102468) internal successors, (792), 527 states have internal predecessors, (792), 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-07 22:37:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 792 transitions. [2025-02-07 22:37:06,276 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 792 transitions. Word has length 80 [2025-02-07 22:37:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:37:06,276 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 792 transitions. [2025-02-07 22:37:06,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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-07 22:37:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 792 transitions. [2025-02-07 22:37:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-07 22:37:06,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:37:06,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:37:06,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:37:06,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:37:06,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:37:06,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1021366931, now seen corresponding path program 1 times [2025-02-07 22:37:06,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:37:06,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685343658] [2025-02-07 22:37:06,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:37:06,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:37:06,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-07 22:37:06,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-07 22:37:06,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:37:06,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:37:06,655 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-07 22:37:06,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:37:06,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685343658] [2025-02-07 22:37:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685343658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:37:06,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:37:06,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:37:06,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495457425] [2025-02-07 22:37:06,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:37:06,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:37:06,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:37:06,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:37:06,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:37:06,659 INFO L87 Difference]: Start difference. First operand 528 states and 792 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 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-07 22:37:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:37:07,134 INFO L93 Difference]: Finished difference Result 938 states and 1404 transitions. [2025-02-07 22:37:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:37:07,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 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 81 [2025-02-07 22:37:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:37:07,137 INFO L225 Difference]: With dead ends: 938 [2025-02-07 22:37:07,138 INFO L226 Difference]: Without dead ends: 549 [2025-02-07 22:37:07,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-07 22:37:07,140 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 802 mSDsluCounter, 3125 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 3751 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:37:07,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 3751 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:37:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-07 22:37:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 531. [2025-02-07 22:37:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.5018867924528303) internal successors, (796), 530 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-07 22:37:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 796 transitions. [2025-02-07 22:37:07,153 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 796 transitions. Word has length 81 [2025-02-07 22:37:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:37:07,153 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 796 transitions. [2025-02-07 22:37:07,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 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-07 22:37:07,153 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 796 transitions. [2025-02-07 22:37:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-07 22:37:07,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:37:07,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:37:07,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:37:07,156 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:37:07,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:37:07,157 INFO L85 PathProgramCache]: Analyzing trace with hash 311625824, now seen corresponding path program 1 times [2025-02-07 22:37:07,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:37:07,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813026474] [2025-02-07 22:37:07,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:37:07,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:37:07,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-07 22:37:07,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-07 22:37:07,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:37:07,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:37:07,712 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-07 22:37:07,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:37:07,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813026474] [2025-02-07 22:37:07,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813026474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:37:07,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:37:07,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:37:07,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643299492] [2025-02-07 22:37:07,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:37:07,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 22:37:07,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:37:07,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 22:37:07,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:37:07,714 INFO L87 Difference]: Start difference. First operand 531 states and 796 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 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-07 22:37:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:37:08,346 INFO L93 Difference]: Finished difference Result 938 states and 1403 transitions. [2025-02-07 22:37:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:37:08,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 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 82 [2025-02-07 22:37:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:37:08,348 INFO L225 Difference]: With dead ends: 938 [2025-02-07 22:37:08,349 INFO L226 Difference]: Without dead ends: 549 [2025-02-07 22:37:08,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:37:08,350 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 796 mSDsluCounter, 3735 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 4358 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:37:08,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 4358 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:37:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-07 22:37:08,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 535. [2025-02-07 22:37:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.5) internal successors, (801), 534 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-07 22:37:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 801 transitions. [2025-02-07 22:37:08,366 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 801 transitions. Word has length 82 [2025-02-07 22:37:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:37:08,366 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 801 transitions. [2025-02-07 22:37:08,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 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-07 22:37:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 801 transitions. [2025-02-07 22:37:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-07 22:37:08,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:37:08,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:37:08,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:37:08,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:37:08,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:37:08,367 INFO L85 PathProgramCache]: Analyzing trace with hash -203213688, now seen corresponding path program 1 times [2025-02-07 22:37:08,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:37:08,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688652608] [2025-02-07 22:37:08,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:37:08,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:37:08,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-07 22:37:08,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-07 22:37:08,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:37:08,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:37:08,469 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 22:37:08,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-07 22:37:08,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-07 22:37:08,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:37:08,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:37:08,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 22:37:08,539 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 22:37:08,539 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 22:37:08,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:37:08,542 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-07 22:37:08,579 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:37:08,598 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 22:37:08,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 10:37:08 BoogieIcfgContainer [2025-02-07 22:37:08,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 22:37:08,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 22:37:08,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 22:37:08,603 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 22:37:08,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:37:03" (3/4) ... [2025-02-07 22:37:08,605 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 22:37:08,606 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 22:37:08,608 INFO L158 Benchmark]: Toolchain (without parser) took 8037.48ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 110.6MB in the beginning and 115.6MB in the end (delta: -5.0MB). Peak memory consumption was 172.7MB. Max. memory is 16.1GB. [2025-02-07 22:37:08,608 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:37:08,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.94ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 66.8MB in the end (delta: 43.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-07 22:37:08,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 158.70ms. Allocated memory is still 142.6MB. Free memory was 66.8MB in the beginning and 81.8MB in the end (delta: -15.0MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2025-02-07 22:37:08,608 INFO L158 Benchmark]: Boogie Preprocessor took 186.75ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 58.8MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 22:37:08,608 INFO L158 Benchmark]: IcfgBuilder took 1928.06ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 58.8MB in the beginning and 85.3MB in the end (delta: -26.5MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. [2025-02-07 22:37:08,608 INFO L158 Benchmark]: TraceAbstraction took 5305.11ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 83.4MB in the beginning and 115.6MB in the end (delta: -32.2MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. [2025-02-07 22:37:08,608 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 318.8MB. Free memory was 115.6MB in the beginning and 115.6MB in the end (delta: 13.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:37:08,609 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.16ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.94ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 66.8MB in the end (delta: 43.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 158.70ms. Allocated memory is still 142.6MB. Free memory was 66.8MB in the beginning and 81.8MB in the end (delta: -15.0MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 186.75ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 58.8MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1928.06ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 58.8MB in the beginning and 85.3MB in the end (delta: -26.5MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5305.11ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 83.4MB in the beginning and 115.6MB in the end (delta: -32.2MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 318.8MB. Free memory was 115.6MB in the beginning and 115.6MB in the end (delta: 13.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 270, overapproximation of bitwiseAnd at line 275. 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_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L30] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 4); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (4 - 1); [L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64); [L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1); [L38] const SORT_121 mask_SORT_121 = (SORT_121)-1 >> (sizeof(SORT_121) * 8 - 2); [L39] const SORT_121 msb_SORT_121 = (SORT_121)1 << (2 - 1); [L41] const SORT_1 var_56 = 0; [L42] const SORT_6 var_60 = 0; [L43] const SORT_1 var_73 = 1; [L44] const SORT_14 var_77 = 0; [L45] const SORT_10 var_107 = 0; [L46] const SORT_10 var_116 = 2; [L47] const SORT_10 var_119 = 4; [L48] const SORT_10 var_126 = 1; [L49] const SORT_121 var_133 = 1; [L50] const SORT_121 var_136 = 3; [L51] const SORT_121 var_139 = 2; [L53] SORT_1 input_2; [L54] SORT_1 input_3; [L55] SORT_1 input_4; [L56] SORT_1 input_5; [L57] SORT_6 input_7; [L58] SORT_6 input_8; [L59] SORT_1 input_9; [L60] SORT_10 input_11; [L61] SORT_1 input_12; [L62] SORT_1 input_13; [L63] SORT_14 input_15; [L64] SORT_10 input_16; [L65] SORT_1 input_17; [L66] SORT_6 input_18; [L67] SORT_1 input_19; [L68] SORT_10 input_20; [L69] SORT_10 input_21; [L70] SORT_6 input_22; [L71] SORT_6 input_23; [L72] SORT_1 input_24; [L73] SORT_14 input_25; [L74] SORT_10 input_26; [L75] SORT_1 input_27; [L76] SORT_6 input_28; [L77] SORT_6 input_29; [L78] SORT_6 input_30; [L79] SORT_6 input_31; [L80] SORT_10 input_32; [L81] SORT_10 input_33; [L82] SORT_10 input_34; [L83] SORT_10 input_35; [L84] SORT_10 input_36; [L85] SORT_10 input_37; [L86] SORT_10 input_38; [L87] SORT_10 input_39; [L88] SORT_1 input_40; [L89] SORT_1 input_41; [L90] SORT_1 input_42; [L91] SORT_1 input_43; [L92] SORT_1 input_44; [L93] SORT_1 input_45; [L94] SORT_14 input_46; [L95] SORT_14 input_47; [L96] SORT_14 input_48; [L97] SORT_14 input_49; [L98] SORT_6 input_50; [L99] SORT_6 input_51; [L100] SORT_1 input_52; [L101] SORT_1 input_53; [L102] SORT_1 input_54; [L103] SORT_1 input_55; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L105] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L106] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L106] SORT_6 state_61 = __VERIFIER_nondet_uint() & mask_SORT_6; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L107] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L108] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L108] SORT_6 state_66 = __VERIFIER_nondet_uint() & mask_SORT_6; [L109] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L109] SORT_14 state_78 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L110] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L110] SORT_14 state_81 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L111] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L111] SORT_1 state_84 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L112] SORT_6 state_90 = __VERIFIER_nondet_uint() & mask_SORT_6; [L113] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L113] SORT_6 state_96 = __VERIFIER_nondet_uint() & mask_SORT_6; [L114] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L114] SORT_10 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L115] SORT_10 state_111 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L116] SORT_1 state_145 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L117] SORT_1 state_148 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L118] SORT_10 state_153 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L119] SORT_10 state_156 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L120] SORT_1 state_171 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L121] SORT_1 state_174 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L122] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L122] SORT_14 state_213 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L123] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L123] SORT_14 state_216 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L124] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L124] SORT_1 state_219 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L125] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L125] SORT_10 state_222 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L126] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L126] SORT_1 state_227 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L127] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L127] SORT_6 state_234 = __VERIFIER_nondet_uint() & mask_SORT_6; [L128] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L128] SORT_1 state_237 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L129] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L129] SORT_10 state_242 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L130] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L130] SORT_6 state_263 = __VERIFIER_nondet_uint() & mask_SORT_6; [L131] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L131] SORT_10 state_274 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L132] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L132] SORT_1 state_302 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L133] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L133] SORT_10 state_307 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L134] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L134] SORT_1 state_323 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L136] SORT_1 init_58_arg_1 = var_56; [L137] state_57 = init_58_arg_1 [L138] SORT_6 init_62_arg_1 = var_60; [L139] state_61 = init_62_arg_1 [L140] SORT_1 init_64_arg_1 = var_56; [L141] state_63 = init_64_arg_1 [L142] SORT_6 init_67_arg_1 = var_60; [L143] state_66 = init_67_arg_1 [L144] SORT_14 init_79_arg_1 = var_77; [L145] state_78 = init_79_arg_1 [L146] SORT_14 init_82_arg_1 = var_77; [L147] state_81 = init_82_arg_1 [L148] SORT_1 init_85_arg_1 = var_56; [L149] state_84 = init_85_arg_1 [L150] SORT_6 init_91_arg_1 = var_60; [L151] state_90 = init_91_arg_1 [L152] SORT_6 init_97_arg_1 = var_60; [L153] state_96 = init_97_arg_1 [L154] SORT_10 init_109_arg_1 = var_107; [L155] state_108 = init_109_arg_1 [L156] SORT_10 init_112_arg_1 = var_107; [L157] state_111 = init_112_arg_1 [L158] SORT_1 init_146_arg_1 = var_56; [L159] state_145 = init_146_arg_1 [L160] SORT_1 init_149_arg_1 = var_56; [L161] state_148 = init_149_arg_1 [L162] SORT_10 init_154_arg_1 = var_107; [L163] state_153 = init_154_arg_1 [L164] SORT_10 init_157_arg_1 = var_107; [L165] state_156 = init_157_arg_1 [L166] SORT_1 init_172_arg_1 = var_56; [L167] state_171 = init_172_arg_1 [L168] SORT_1 init_175_arg_1 = var_56; [L169] state_174 = init_175_arg_1 [L170] SORT_14 init_214_arg_1 = var_77; [L171] state_213 = init_214_arg_1 [L172] SORT_14 init_217_arg_1 = var_77; [L173] state_216 = init_217_arg_1 [L174] SORT_1 init_220_arg_1 = var_56; [L175] state_219 = init_220_arg_1 [L176] SORT_10 init_223_arg_1 = var_107; [L177] state_222 = init_223_arg_1 [L178] SORT_1 init_228_arg_1 = var_56; [L179] state_227 = init_228_arg_1 [L180] SORT_6 init_235_arg_1 = var_60; [L181] state_234 = init_235_arg_1 [L182] SORT_1 init_238_arg_1 = var_56; [L183] state_237 = init_238_arg_1 [L184] SORT_10 init_243_arg_1 = var_107; [L185] state_242 = init_243_arg_1 [L186] SORT_6 init_264_arg_1 = var_60; [L187] state_263 = init_264_arg_1 [L188] SORT_10 init_275_arg_1 = var_107; [L189] state_274 = init_275_arg_1 [L190] SORT_1 init_303_arg_1 = var_56; [L191] state_302 = init_303_arg_1 [L192] SORT_10 init_308_arg_1 = var_107; [L193] state_307 = init_308_arg_1 [L194] SORT_1 init_324_arg_1 = var_56; [L195] state_323 = init_324_arg_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L198] input_2 = __VERIFIER_nondet_uchar() [L199] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L199] input_2 = input_2 & mask_SORT_1 [L200] input_3 = __VERIFIER_nondet_uchar() [L201] input_4 = __VERIFIER_nondet_uchar() [L202] input_5 = __VERIFIER_nondet_uchar() [L203] input_7 = __VERIFIER_nondet_uint() [L204] input_8 = __VERIFIER_nondet_uint() [L205] input_9 = __VERIFIER_nondet_uchar() [L206] EXPR input_9 & mask_SORT_1 VAL [input_2=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L206] input_9 = input_9 & mask_SORT_1 [L207] input_11 = __VERIFIER_nondet_uchar() [L208] input_12 = __VERIFIER_nondet_uchar() [L209] input_13 = __VERIFIER_nondet_uchar() [L210] input_15 = __VERIFIER_nondet_ulong() [L211] input_16 = __VERIFIER_nondet_uchar() [L212] input_17 = __VERIFIER_nondet_uchar() [L213] input_18 = __VERIFIER_nondet_uint() [L214] input_19 = __VERIFIER_nondet_uchar() [L215] input_20 = __VERIFIER_nondet_uchar() [L216] input_21 = __VERIFIER_nondet_uchar() [L217] input_22 = __VERIFIER_nondet_uint() [L218] input_23 = __VERIFIER_nondet_uint() [L219] input_24 = __VERIFIER_nondet_uchar() [L220] input_25 = __VERIFIER_nondet_ulong() [L221] input_26 = __VERIFIER_nondet_uchar() [L222] input_27 = __VERIFIER_nondet_uchar() [L223] input_28 = __VERIFIER_nondet_uint() [L224] input_29 = __VERIFIER_nondet_uint() [L225] input_30 = __VERIFIER_nondet_uint() [L226] input_31 = __VERIFIER_nondet_uint() [L227] input_32 = __VERIFIER_nondet_uchar() [L228] input_33 = __VERIFIER_nondet_uchar() [L229] input_34 = __VERIFIER_nondet_uchar() [L230] input_35 = __VERIFIER_nondet_uchar() [L231] input_36 = __VERIFIER_nondet_uchar() [L232] input_37 = __VERIFIER_nondet_uchar() [L233] input_38 = __VERIFIER_nondet_uchar() [L234] input_39 = __VERIFIER_nondet_uchar() [L235] input_40 = __VERIFIER_nondet_uchar() [L236] input_41 = __VERIFIER_nondet_uchar() [L237] input_42 = __VERIFIER_nondet_uchar() [L238] input_43 = __VERIFIER_nondet_uchar() [L239] input_44 = __VERIFIER_nondet_uchar() [L240] input_45 = __VERIFIER_nondet_uchar() [L241] input_46 = __VERIFIER_nondet_ulong() [L242] input_47 = __VERIFIER_nondet_ulong() [L243] input_48 = __VERIFIER_nondet_ulong() [L244] input_49 = __VERIFIER_nondet_ulong() [L245] input_50 = __VERIFIER_nondet_uint() [L246] input_51 = __VERIFIER_nondet_uint() [L247] input_52 = __VERIFIER_nondet_uchar() [L248] input_53 = __VERIFIER_nondet_uchar() [L249] input_54 = __VERIFIER_nondet_uchar() [L250] input_55 = __VERIFIER_nondet_uchar() [L253] SORT_1 var_59_arg_0 = state_57; [L254] SORT_1 var_59 = ~var_59_arg_0; [L255] SORT_1 var_65_arg_0 = state_63; [L256] SORT_6 var_65_arg_1 = state_61; [L257] SORT_6 var_65_arg_2 = input_18; [L258] SORT_6 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; VAL [input_18=0, input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0] [L259] EXPR var_65 & mask_SORT_6 VAL [input_18=0, input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_73=1, var_77=0] [L259] var_65 = var_65 & mask_SORT_6 [L260] SORT_1 var_68_arg_0 = state_63; [L261] SORT_6 var_68_arg_1 = state_66; [L262] SORT_6 var_68_arg_2 = input_18; [L263] SORT_6 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_65=0, var_68=0, var_73=1, var_77=0] [L264] EXPR var_68 & mask_SORT_6 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0] [L264] var_68 = var_68 & mask_SORT_6 [L265] SORT_6 var_69_arg_0 = var_65; [L266] SORT_6 var_69_arg_1 = var_68; [L267] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L268] SORT_1 var_70_arg_0 = var_59; [L269] SORT_1 var_70_arg_1 = var_69; VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_70_arg_0=-1, var_70_arg_1=1, var_73=1, var_77=0] [L270] EXPR var_70_arg_0 | var_70_arg_1 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0] [L270] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L271] SORT_1 var_74_arg_0 = var_70; [L272] SORT_1 var_74 = ~var_74_arg_0; [L273] SORT_1 var_75_arg_0 = var_73; [L274] SORT_1 var_75_arg_1 = var_74; VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_75_arg_0=1, var_75_arg_1=-1, var_77=0] [L275] EXPR var_75_arg_0 & var_75_arg_1 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0] [L275] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L276] EXPR var_75 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0] [L276] var_75 = var_75 & mask_SORT_1 [L277] SORT_1 bad_76_arg_0 = var_75; [L278] CALL __VERIFIER_assert(!(bad_76_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 508 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2397 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2397 mSDsluCounter, 14432 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11280 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3089 IncrementalHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 3152 mSDtfsCounter, 3089 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=535occurred in iteration=5, InterpolantAutomatonStates: 31, 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, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 1243 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-07 22:37:08,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.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 e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:37:10,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:37:10,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 22:37:10,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:37:10,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:37:10,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:37:10,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:37:10,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:37:10,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:37:10,675 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:37:10,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:37:10,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:37:10,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:37:10,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:37:10,675 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:37:10,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:37:10,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:37:10,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:37:10,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:37:10,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:37:10,676 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:37:10,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:37:10,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:37:10,676 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 -> e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec [2025-02-07 22:37:10,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:37:10,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:37:10,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:37:10,902 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:37:10,902 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:37:10,902 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.cal2.c [2025-02-07 22:37:12,085 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/352290283/0e7065f33e284c44bab20d8327c1a69f/FLAG3a57c97da [2025-02-07 22:37:12,367 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:37:12,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c [2025-02-07 22:37:12,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/352290283/0e7065f33e284c44bab20d8327c1a69f/FLAG3a57c97da [2025-02-07 22:37:12,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/352290283/0e7065f33e284c44bab20d8327c1a69f [2025-02-07 22:37:12,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:37:12,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:37:12,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:37:12,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:37:12,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:37:12,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:37:12" (1/1) ... [2025-02-07 22:37:12,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f995225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:12, skipping insertion in model container [2025-02-07 22:37:12,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:37:12" (1/1) ... [2025-02-07 22:37:12,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:37:12,838 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.cal2.c[1244,1257] [2025-02-07 22:37:12,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:37:12,987 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:37:13,003 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.cal2.c[1244,1257] [2025-02-07 22:37:13,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:37:13,073 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:37:13,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:13 WrapperNode [2025-02-07 22:37:13,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:37:13,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:37:13,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:37:13,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:37:13,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:13" (1/1) ... [2025-02-07 22:37:13,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:13" (1/1) ... [2025-02-07 22:37:13,208 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1327 [2025-02-07 22:37:13,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:37:13,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:37:13,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:37:13,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:37:13,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:13" (1/1) ... [2025-02-07 22:37:13,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:13" (1/1) ... [2025-02-07 22:37:13,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:13" (1/1) ... [2025-02-07 22:37:13,243 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-02-07 22:37:13,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:13" (1/1) ... [2025-02-07 22:37:13,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:13" (1/1) ... [2025-02-07 22:37:13,273 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:13" (1/1) ... [2025-02-07 22:37:13,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:13" (1/1) ... [2025-02-07 22:37:13,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:13" (1/1) ... [2025-02-07 22:37:13,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:13" (1/1) ... [2025-02-07 22:37:13,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:37:13,295 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:37:13,295 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:37:13,295 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:37:13,296 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:13" (1/1) ... [2025-02-07 22:37:13,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:37:13,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:37:13,322 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-07 22:37:13,328 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-07 22:37:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:37:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 22:37:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 22:37:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:37:13,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:37:13,559 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:37:13,561 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:37:14,367 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-02-07 22:37:14,368 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:37:14,375 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:37:14,376 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:37:14,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:37:14 BoogieIcfgContainer [2025-02-07 22:37:14,376 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:37:14,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:37:14,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:37:14,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:37:14,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:37:12" (1/3) ... [2025-02-07 22:37:14,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdaab5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:37:14, skipping insertion in model container [2025-02-07 22:37:14,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:37:13" (2/3) ... [2025-02-07 22:37:14,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdaab5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:37:14, skipping insertion in model container [2025-02-07 22:37:14,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:37:14" (3/3) ... [2025-02-07 22:37:14,382 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal2.c [2025-02-07 22:37:14,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:37:14,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal2.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:37:14,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:37:14,436 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;@6be8ed63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:37:14,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:37:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:37:14,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 22:37:14,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:37:14,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 22:37:14,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:37:14,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:37:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 22:37:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:37:14,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50223908] [2025-02-07 22:37:14,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:37:14,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:37:14,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:37:14,465 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-07 22:37:14,466 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-07 22:37:14,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 22:37:14,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 22:37:14,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:37:14,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:37:14,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 22:37:14,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:37:14,849 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-07 22:37:14,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:37:14,850 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:37:14,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50223908] [2025-02-07 22:37:14,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50223908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:37:14,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:37:14,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 22:37:14,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255615495] [2025-02-07 22:37:14,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:37:14,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:37:14,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:37:14,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:37:14,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:37:14,866 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:37:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:37:15,029 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 22:37:15,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:37:15,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-07 22:37:15,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:37:15,034 INFO L225 Difference]: With dead ends: 16 [2025-02-07 22:37:15,035 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 22:37:15,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:37:15,038 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:37:15,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:37:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 22:37:15,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 22:37:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:37:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 22:37:15,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 22:37:15,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:37:15,071 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 22:37:15,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:37:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 22:37:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 22:37:15,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:37:15,071 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 22:37:15,078 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-07 22:37:15,276 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-07 22:37:15,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:37:15,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:37:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 22:37:15,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:37:15,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122391678] [2025-02-07 22:37:15,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:37:15,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:37:15,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:37:15,282 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-07 22:37:15,283 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-07 22:37:15,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 22:37:15,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 22:37:15,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:37:15,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:37:15,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-07 22:37:15,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:37:15,835 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-07 22:37:15,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:37:16,548 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-07 22:37:16,548 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:37:16,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122391678] [2025-02-07 22:37:16,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122391678] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:37:16,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:37:16,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 22:37:16,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418738926] [2025-02-07 22:37:16,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 22:37:16,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 22:37:16,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:37:16,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 22:37:16,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:37:16,550 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:37:16,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:37:16,840 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-02-07 22:37:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:37:16,840 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 22:37:16,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:37:16,840 INFO L225 Difference]: With dead ends: 14 [2025-02-07 22:37:16,840 INFO L226 Difference]: Without dead ends: 12 [2025-02-07 22:37:16,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-02-07 22:37:16,841 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:37:16,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:37:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-07 22:37:16,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-02-07 22:37:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:37:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-07 22:37:16,843 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-07 22:37:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:37:16,843 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-07 22:37:16,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:37:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-07 22:37:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 22:37:16,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:37:16,844 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-07 22:37:16,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 22:37:17,048 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-07 22:37:17,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:37:17,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:37:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-07 22:37:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:37:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794271087] [2025-02-07 22:37:17,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 22:37:17,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:37:17,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:37:17,054 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-07 22:37:17,056 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-07 22:37:17,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-07 22:37:18,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 22:37:18,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 22:37:18,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:37:18,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-07 22:37:18,781 INFO L279 TraceCheckSpWp]: Computing forward predicates...