./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.lann.1.prop1-func-interl.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.lann.1.prop1-func-interl.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 cd6ac0f1fc1701a755f398ed8f8c999e6c7d4b309c48c83fd17b2861bc532c01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:21:12,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:21:12,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:21:12,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:21:12,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:21:12,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:21:12,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:21:12,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:21:12,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:21:12,242 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:21:12,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:21:12,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:21:12,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:21:12,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:21:12,242 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:21:12,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:21:12,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:21:12,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:21:12,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:21:12,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:21:12,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:21:12,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:21:12,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:21:12,243 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:21:12,243 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:21:12,243 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:21:12,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:21:12,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:21:12,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:21:12,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:21:12,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:21:12,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:21:12,244 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:21:12,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:21:12,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:21:12,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:21:12,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:21:12,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:21:12,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:21:12,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:21:12,244 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 -> cd6ac0f1fc1701a755f398ed8f8c999e6c7d4b309c48c83fd17b2861bc532c01 [2025-02-07 23:21:12,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:21:12,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:21:12,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:21:12,468 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:21:12,468 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:21:12,469 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.lann.1.prop1-func-interl.c [2025-02-07 23:21:13,600 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b36103fbb/30b663006de540068a13151e607efb6c/FLAG4d5ae1682 [2025-02-07 23:21:14,042 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:21:14,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.lann.1.prop1-func-interl.c [2025-02-07 23:21:14,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b36103fbb/30b663006de540068a13151e607efb6c/FLAG4d5ae1682 [2025-02-07 23:21:14,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b36103fbb/30b663006de540068a13151e607efb6c [2025-02-07 23:21:14,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:21:14,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:21:14,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:21:14,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:21:14,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:21:14,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:21:14" (1/1) ... [2025-02-07 23:21:14,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f887bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14, skipping insertion in model container [2025-02-07 23:21:14,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:21:14" (1/1) ... [2025-02-07 23:21:14,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:21:14,344 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.lann.1.prop1-func-interl.c[1171,1184] [2025-02-07 23:21:14,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:21:14,591 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:21:14,598 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.lann.1.prop1-func-interl.c[1171,1184] [2025-02-07 23:21:14,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:21:14,777 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:21:14,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14 WrapperNode [2025-02-07 23:21:14,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:21:14,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:21:14,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:21:14,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:21:14,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14" (1/1) ... [2025-02-07 23:21:14,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14" (1/1) ... [2025-02-07 23:21:15,314 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 6281 [2025-02-07 23:21:15,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:21:15,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:21:15,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:21:15,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:21:15,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14" (1/1) ... [2025-02-07 23:21:15,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14" (1/1) ... [2025-02-07 23:21:15,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14" (1/1) ... [2025-02-07 23:21:15,645 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 23:21:15,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14" (1/1) ... [2025-02-07 23:21:15,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14" (1/1) ... [2025-02-07 23:21:15,772 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14" (1/1) ... [2025-02-07 23:21:15,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14" (1/1) ... [2025-02-07 23:21:15,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14" (1/1) ... [2025-02-07 23:21:15,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14" (1/1) ... [2025-02-07 23:21:16,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:21:16,004 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:21:16,004 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:21:16,004 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:21:16,006 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14" (1/1) ... [2025-02-07 23:21:16,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:21:16,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:21:16,036 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 23:21:16,044 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 23:21:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:21:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:21:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:21:16,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:21:16,378 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:21:16,379 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:21:21,964 INFO L? ?]: Removed 3405 outVars from TransFormulas that were not future-live. [2025-02-07 23:21:21,965 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:21:22,120 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:21:22,120 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:21:22,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:21:22 BoogieIcfgContainer [2025-02-07 23:21:22,121 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:21:22,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:21:22,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:21:22,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:21:22,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:21:14" (1/3) ... [2025-02-07 23:21:22,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21150527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:21:22, skipping insertion in model container [2025-02-07 23:21:22,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:14" (2/3) ... [2025-02-07 23:21:22,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21150527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:21:22, skipping insertion in model container [2025-02-07 23:21:22,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:21:22" (3/3) ... [2025-02-07 23:21:22,127 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.lann.1.prop1-func-interl.c [2025-02-07 23:21:22,139 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:21:22,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.lann.1.prop1-func-interl.c that has 1 procedures, 2268 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:21:22,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:21:22,258 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;@6a7cad1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:21:22,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:21:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 2268 states, 2266 states have (on average 1.5) internal successors, (3399), 2267 states have internal predecessors, (3399), 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 23:21:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-07 23:21:22,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:21:22,274 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, 1, 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 23:21:22,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:21:22,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:21:22,278 INFO L85 PathProgramCache]: Analyzing trace with hash 760042670, now seen corresponding path program 1 times [2025-02-07 23:21:22,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:21:22,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794834932] [2025-02-07 23:21:22,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:21:22,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:21:22,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-07 23:21:22,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-07 23:21:22,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:21:22,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:21:23,124 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 23:21:23,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:21:23,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794834932] [2025-02-07 23:21:23,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794834932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:21:23,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:21:23,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:21:23,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101913123] [2025-02-07 23:21:23,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:21:23,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:21:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:21:23,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:21:23,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:21:23,149 INFO L87 Difference]: Start difference. First operand has 2268 states, 2266 states have (on average 1.5) internal successors, (3399), 2267 states have internal predecessors, (3399), 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 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 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 23:21:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:21:26,518 INFO L93 Difference]: Finished difference Result 6234 states and 9347 transitions. [2025-02-07 23:21:26,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:21:26,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 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 108 [2025-02-07 23:21:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:21:26,541 INFO L225 Difference]: With dead ends: 6234 [2025-02-07 23:21:26,541 INFO L226 Difference]: Without dead ends: 4067 [2025-02-07 23:21:26,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:21:26,548 INFO L435 NwaCegarLoop]: 2143 mSDtfsCounter, 2756 mSDsluCounter, 6058 mSDsCounter, 0 mSdLazyCounter, 5232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2756 SdHoareTripleChecker+Valid, 8201 SdHoareTripleChecker+Invalid, 5233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:21:26,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2756 Valid, 8201 Invalid, 5233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5232 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-07 23:21:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2025-02-07 23:21:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 2353. [2025-02-07 23:21:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 2352 states have (on average 1.4987244897959184) internal successors, (3525), 2352 states have internal predecessors, (3525), 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 23:21:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 3525 transitions. [2025-02-07 23:21:26,643 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 3525 transitions. Word has length 108 [2025-02-07 23:21:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:21:26,644 INFO L471 AbstractCegarLoop]: Abstraction has 2353 states and 3525 transitions. [2025-02-07 23:21:26,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 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 23:21:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 3525 transitions. [2025-02-07 23:21:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-07 23:21:26,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:21:26,647 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, 1, 1, 1, 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 23:21:26,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:21:26,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:21:26,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:21:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1331873614, now seen corresponding path program 1 times [2025-02-07 23:21:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:21:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201533807] [2025-02-07 23:21:26,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:21:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:21:26,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-07 23:21:26,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-07 23:21:26,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:21:26,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:21:26,906 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 23:21:26,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:21:26,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201533807] [2025-02-07 23:21:26,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201533807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:21:26,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:21:26,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:21:26,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893895760] [2025-02-07 23:21:26,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:21:26,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:21:26,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:21:26,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:21:26,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:21:26,909 INFO L87 Difference]: Start difference. First operand 2353 states and 3525 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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 23:21:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:21:29,064 INFO L93 Difference]: Finished difference Result 4518 states and 6770 transitions. [2025-02-07 23:21:29,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:21:29,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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 110 [2025-02-07 23:21:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:21:29,075 INFO L225 Difference]: With dead ends: 4518 [2025-02-07 23:21:29,075 INFO L226 Difference]: Without dead ends: 2353 [2025-02-07 23:21:29,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:21:29,081 INFO L435 NwaCegarLoop]: 2046 mSDtfsCounter, 3386 mSDsluCounter, 4082 mSDsCounter, 0 mSdLazyCounter, 4048 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3386 SdHoareTripleChecker+Valid, 6128 SdHoareTripleChecker+Invalid, 4049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:21:29,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3386 Valid, 6128 Invalid, 4049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4048 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-07 23:21:29,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2025-02-07 23:21:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2353. [2025-02-07 23:21:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 2352 states have (on average 1.498299319727891) internal successors, (3524), 2352 states have internal predecessors, (3524), 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 23:21:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 3524 transitions. [2025-02-07 23:21:29,127 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 3524 transitions. Word has length 110 [2025-02-07 23:21:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:21:29,128 INFO L471 AbstractCegarLoop]: Abstraction has 2353 states and 3524 transitions. [2025-02-07 23:21:29,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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 23:21:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 3524 transitions. [2025-02-07 23:21:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-07 23:21:29,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:21:29,132 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, 1, 1, 1, 1, 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 23:21:29,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:21:29,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:21:29,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:21:29,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1469166982, now seen corresponding path program 1 times [2025-02-07 23:21:29,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:21:29,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303497975] [2025-02-07 23:21:29,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:21:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:21:29,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-07 23:21:29,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-07 23:21:29,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:21:29,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:21:29,584 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 23:21:29,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:21:29,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303497975] [2025-02-07 23:21:29,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303497975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:21:29,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:21:29,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:21:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015614617] [2025-02-07 23:21:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:21:29,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:21:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:21:29,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:21:29,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:21:29,585 INFO L87 Difference]: Start difference. First operand 2353 states and 3524 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 23:21:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:21:30,492 INFO L93 Difference]: Finished difference Result 2357 states and 3528 transitions. [2025-02-07 23:21:30,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:21:30,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 111 [2025-02-07 23:21:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:21:30,500 INFO L225 Difference]: With dead ends: 2357 [2025-02-07 23:21:30,500 INFO L226 Difference]: Without dead ends: 2355 [2025-02-07 23:21:30,501 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 23:21:30,501 INFO L435 NwaCegarLoop]: 2828 mSDtfsCounter, 0 mSDsluCounter, 5651 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8479 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 23:21:30,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8479 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 23:21:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2025-02-07 23:21:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 2355. [2025-02-07 23:21:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2355 states, 2354 states have (on average 1.497875955819881) internal successors, (3526), 2354 states have internal predecessors, (3526), 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 23:21:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3526 transitions. [2025-02-07 23:21:30,530 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3526 transitions. Word has length 111 [2025-02-07 23:21:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:21:30,531 INFO L471 AbstractCegarLoop]: Abstraction has 2355 states and 3526 transitions. [2025-02-07 23:21:30,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 23:21:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3526 transitions. [2025-02-07 23:21:30,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-07 23:21:30,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:21:30,534 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, 1, 1, 1, 1, 1, 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 23:21:30,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:21:30,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:21:30,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:21:30,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1695781080, now seen corresponding path program 1 times [2025-02-07 23:21:30,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:21:30,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718289276] [2025-02-07 23:21:30,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:21:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:21:30,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-07 23:21:30,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-07 23:21:30,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:21:30,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:21:30,701 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 23:21:30,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:21:30,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718289276] [2025-02-07 23:21:30,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718289276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:21:30,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:21:30,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:21:30,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501868352] [2025-02-07 23:21:30,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:21:30,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:21:30,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:21:30,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:21:30,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:21:30,704 INFO L87 Difference]: Start difference. First operand 2355 states and 3526 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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 23:21:31,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:21:31,527 INFO L93 Difference]: Finished difference Result 4524 states and 6775 transitions. [2025-02-07 23:21:31,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:21:31,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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 112 [2025-02-07 23:21:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:21:31,535 INFO L225 Difference]: With dead ends: 4524 [2025-02-07 23:21:31,535 INFO L226 Difference]: Without dead ends: 2357 [2025-02-07 23:21:31,538 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 23:21:31,540 INFO L435 NwaCegarLoop]: 2828 mSDtfsCounter, 0 mSDsluCounter, 5648 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8476 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:21:31,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8476 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:21:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2025-02-07 23:21:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2357. [2025-02-07 23:21:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2356 states have (on average 1.497453310696095) internal successors, (3528), 2356 states have internal predecessors, (3528), 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 23:21:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3528 transitions. [2025-02-07 23:21:31,581 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3528 transitions. Word has length 112 [2025-02-07 23:21:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:21:31,582 INFO L471 AbstractCegarLoop]: Abstraction has 2357 states and 3528 transitions. [2025-02-07 23:21:31,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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 23:21:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3528 transitions. [2025-02-07 23:21:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-07 23:21:31,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:21:31,583 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, 1, 1, 1, 1, 1, 1, 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 23:21:31,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:21:31,583 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:21:31,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:21:31,584 INFO L85 PathProgramCache]: Analyzing trace with hash 901906881, now seen corresponding path program 1 times [2025-02-07 23:21:31,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:21:31,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736562481] [2025-02-07 23:21:31,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:21:31,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:21:31,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-07 23:21:31,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-07 23:21:31,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:21:31,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:21:31,808 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 23:21:31,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:21:31,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736562481] [2025-02-07 23:21:31,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736562481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:21:31,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:21:31,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:21:31,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118313819] [2025-02-07 23:21:31,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:21:31,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:21:31,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:21:31,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:21:31,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:21:31,810 INFO L87 Difference]: Start difference. First operand 2357 states and 3528 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 23:21:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:21:32,566 INFO L93 Difference]: Finished difference Result 4532 states and 6784 transitions. [2025-02-07 23:21:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:21:32,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 113 [2025-02-07 23:21:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:21:32,573 INFO L225 Difference]: With dead ends: 4532 [2025-02-07 23:21:32,573 INFO L226 Difference]: Without dead ends: 2363 [2025-02-07 23:21:32,575 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 23:21:32,576 INFO L435 NwaCegarLoop]: 2828 mSDtfsCounter, 2 mSDsluCounter, 5643 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8471 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:21:32,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8471 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:21:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2025-02-07 23:21:32,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2363. [2025-02-07 23:21:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2362 states have (on average 1.4966130397967823) internal successors, (3535), 2362 states have internal predecessors, (3535), 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 23:21:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3535 transitions. [2025-02-07 23:21:32,608 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3535 transitions. Word has length 113 [2025-02-07 23:21:32,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:21:32,608 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 3535 transitions. [2025-02-07 23:21:32,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 23:21:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3535 transitions. [2025-02-07 23:21:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-07 23:21:32,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:21:32,610 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, 1, 1, 1, 1, 1, 1, 1, 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 23:21:32,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:21:32,610 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:21:32,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:21:32,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1405856728, now seen corresponding path program 1 times [2025-02-07 23:21:32,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:21:32,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894429786] [2025-02-07 23:21:32,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:21:32,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:21:32,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-07 23:21:32,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-07 23:21:32,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:21:32,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:21:32,801 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 23:21:32,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:21:32,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894429786] [2025-02-07 23:21:32,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894429786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:21:32,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:21:32,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:21:32,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268788035] [2025-02-07 23:21:32,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:21:32,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:21:32,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:21:32,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:21:32,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:21:32,805 INFO L87 Difference]: Start difference. First operand 2363 states and 3535 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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 23:21:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:21:34,739 INFO L93 Difference]: Finished difference Result 4538 states and 6790 transitions. [2025-02-07 23:21:34,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:21:34,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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 114 [2025-02-07 23:21:34,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:21:34,752 INFO L225 Difference]: With dead ends: 4538 [2025-02-07 23:21:34,752 INFO L226 Difference]: Without dead ends: 2363 [2025-02-07 23:21:34,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:21:34,754 INFO L435 NwaCegarLoop]: 2046 mSDtfsCounter, 3294 mSDsluCounter, 4082 mSDsCounter, 0 mSdLazyCounter, 4045 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3294 SdHoareTripleChecker+Valid, 6128 SdHoareTripleChecker+Invalid, 4045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-07 23:21:34,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3294 Valid, 6128 Invalid, 4045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4045 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-07 23:21:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2025-02-07 23:21:34,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2363. [2025-02-07 23:21:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2362 states have (on average 1.495766299745978) internal successors, (3533), 2362 states have internal predecessors, (3533), 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 23:21:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3533 transitions. [2025-02-07 23:21:34,823 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3533 transitions. Word has length 114 [2025-02-07 23:21:34,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:21:34,824 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 3533 transitions. [2025-02-07 23:21:34,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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 23:21:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3533 transitions. [2025-02-07 23:21:34,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-07 23:21:34,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:21:34,828 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:21:34,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:21:34,828 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:21:34,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:21:34,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2038944120, now seen corresponding path program 1 times [2025-02-07 23:21:34,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:21:34,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747110648] [2025-02-07 23:21:34,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:21:34,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:21:34,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-07 23:21:34,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-07 23:21:34,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:21:34,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:21:35,038 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 23:21:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:21:35,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747110648] [2025-02-07 23:21:35,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747110648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:21:35,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:21:35,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:21:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055993461] [2025-02-07 23:21:35,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:21:35,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:21:35,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:21:35,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:21:35,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:21:35,040 INFO L87 Difference]: Start difference. First operand 2363 states and 3533 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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 23:21:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:21:38,006 INFO L93 Difference]: Finished difference Result 6608 states and 9884 transitions. [2025-02-07 23:21:38,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:21:38,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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 115 [2025-02-07 23:21:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:21:38,015 INFO L225 Difference]: With dead ends: 6608 [2025-02-07 23:21:38,015 INFO L226 Difference]: Without dead ends: 4433 [2025-02-07 23:21:38,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:21:38,017 INFO L435 NwaCegarLoop]: 2056 mSDtfsCounter, 3273 mSDsluCounter, 6062 mSDsCounter, 0 mSdLazyCounter, 5307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3273 SdHoareTripleChecker+Valid, 8118 SdHoareTripleChecker+Invalid, 5308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-07 23:21:38,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3273 Valid, 8118 Invalid, 5308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5307 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-07 23:21:38,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2025-02-07 23:21:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 2371. [2025-02-07 23:21:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2370 states have (on average 1.4949367088607595) internal successors, (3543), 2370 states have internal predecessors, (3543), 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 23:21:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3543 transitions. [2025-02-07 23:21:38,056 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3543 transitions. Word has length 115 [2025-02-07 23:21:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:21:38,056 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3543 transitions. [2025-02-07 23:21:38,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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 23:21:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3543 transitions. [2025-02-07 23:21:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-07 23:21:38,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:21:38,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:21:38,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 23:21:38,057 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:21:38,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:21:38,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1869046750, now seen corresponding path program 1 times [2025-02-07 23:21:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:21:38,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975884330] [2025-02-07 23:21:38,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:21:38,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:21:38,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-07 23:21:38,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-07 23:21:38,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:21:38,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:21:38,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:21:38,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-07 23:21:38,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-07 23:21:38,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:21:38,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:21:38,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:21:38,225 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:21:38,226 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:21:38,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 23:21:38,229 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:21:38,298 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:21:38,319 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:21:38,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:21:38 BoogieIcfgContainer [2025-02-07 23:21:38,325 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:21:38,326 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:21:38,326 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:21:38,326 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:21:38,327 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:21:22" (3/4) ... [2025-02-07 23:21:38,328 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:21:38,329 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:21:38,329 INFO L158 Benchmark]: Toolchain (without parser) took 24213.14ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 103.4MB in the beginning and 349.2MB in the end (delta: -245.7MB). Peak memory consumption was 288.8MB. Max. memory is 16.1GB. [2025-02-07 23:21:38,329 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:21:38,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 660.68ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 76.1MB in the end (delta: 26.5MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. [2025-02-07 23:21:38,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 536.82ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 76.1MB in the beginning and 151.0MB in the end (delta: -74.9MB). Peak memory consumption was 116.6MB. Max. memory is 16.1GB. [2025-02-07 23:21:38,330 INFO L158 Benchmark]: Boogie Preprocessor took 687.45ms. Allocated memory is still 335.5MB. Free memory was 151.0MB in the beginning and 152.7MB in the end (delta: -1.8MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. [2025-02-07 23:21:38,331 INFO L158 Benchmark]: IcfgBuilder took 6116.98ms. Allocated memory was 335.5MB in the beginning and 914.4MB in the end (delta: 578.8MB). Free memory was 152.7MB in the beginning and 510.4MB in the end (delta: -357.6MB). Peak memory consumption was 562.1MB. Max. memory is 16.1GB. [2025-02-07 23:21:38,331 INFO L158 Benchmark]: TraceAbstraction took 16203.25ms. Allocated memory was 914.4MB in the beginning and 671.1MB in the end (delta: -243.3MB). Free memory was 510.4MB in the beginning and 349.2MB in the end (delta: 161.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:21:38,331 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 671.1MB. Free memory was 349.2MB in the beginning and 349.2MB in the end (delta: 55.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:21:38,332 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.21ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 660.68ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 76.1MB in the end (delta: 26.5MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 536.82ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 76.1MB in the beginning and 151.0MB in the end (delta: -74.9MB). Peak memory consumption was 116.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 687.45ms. Allocated memory is still 335.5MB. Free memory was 151.0MB in the beginning and 152.7MB in the end (delta: -1.8MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. * IcfgBuilder took 6116.98ms. Allocated memory was 335.5MB in the beginning and 914.4MB in the end (delta: 578.8MB). Free memory was 152.7MB in the beginning and 510.4MB in the end (delta: -357.6MB). Peak memory consumption was 562.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16203.25ms. Allocated memory was 914.4MB in the beginning and 671.1MB in the end (delta: -243.3MB). Free memory was 510.4MB in the beginning and 349.2MB in the end (delta: 161.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 671.1MB. Free memory was 349.2MB in the beginning and 349.2MB in the end (delta: 55.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 236, overapproximation of bitwiseAnd at line 211, overapproximation of bitwiseAnd at line 234. 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_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_24 = 0; [L40] const SORT_4 var_57 = 1; [L41] const SORT_4 var_58 = 0; [L42] const SORT_2 var_68 = 2; [L43] const SORT_2 var_70 = 1; [L44] const SORT_2 var_72 = 0; [L45] const SORT_2 var_108 = 6; [L46] const SORT_2 var_109 = 255; [L47] const SORT_2 var_118 = 24; [L48] const SORT_2 var_127 = 14; [L49] const SORT_3 var_292 = 0; [L50] const SORT_4 var_294 = 6; [L51] const SORT_4 var_326 = 24; [L52] const SORT_4 var_358 = 14; [L54] SORT_1 input_67; [L55] SORT_1 input_69; [L56] SORT_1 input_71; [L57] SORT_1 input_73; [L58] SORT_1 input_79; [L59] SORT_1 input_82; [L60] SORT_1 input_83; [L61] SORT_1 input_84; [L62] SORT_1 input_85; [L63] SORT_1 input_91; [L64] SORT_1 input_94; [L65] SORT_1 input_95; [L66] SORT_1 input_96; [L67] SORT_1 input_97; [L68] SORT_1 input_103; [L69] SORT_1 input_106; [L70] SORT_1 input_107; [L71] SORT_1 input_116; [L72] SORT_1 input_117; [L73] SORT_1 input_125; [L74] SORT_1 input_126; [L75] SORT_1 input_141; [L76] SORT_1 input_143; [L77] SORT_1 input_162; [L78] SORT_1 input_164; [L79] SORT_1 input_183; [L80] SORT_1 input_185; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L82] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L83] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L84] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L85] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L86] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L87] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L88] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L89] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L90] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L91] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L92] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L93] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L94] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L95] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L96] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L97] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L98] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L99] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L100] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L100] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L101] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L101] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L102] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L102] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L103] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L103] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L104] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L104] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L105] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L106] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_108=6, var_109=255, var_118=24, var_127=14, var_24=0, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_5=0, var_68=2, var_70=1, var_72=0] [L106] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L108] SORT_2 init_7_arg_1 = var_5; [L109] state_6 = init_7_arg_1 [L110] SORT_2 init_9_arg_1 = var_5; [L111] state_8 = init_9_arg_1 [L112] SORT_2 init_11_arg_1 = var_5; [L113] state_10 = init_11_arg_1 [L114] SORT_2 init_13_arg_1 = var_5; [L115] state_12 = init_13_arg_1 [L116] SORT_2 init_15_arg_1 = var_5; [L117] state_14 = init_15_arg_1 [L118] SORT_2 init_17_arg_1 = var_5; [L119] state_16 = init_17_arg_1 [L120] SORT_2 init_19_arg_1 = var_5; [L121] state_18 = init_19_arg_1 [L122] SORT_2 init_21_arg_1 = var_5; [L123] state_20 = init_21_arg_1 [L124] SORT_2 init_23_arg_1 = var_5; [L125] state_22 = init_23_arg_1 [L126] SORT_1 init_26_arg_1 = var_24; [L127] state_25 = init_26_arg_1 [L128] SORT_1 init_28_arg_1 = var_24; [L129] state_27 = init_28_arg_1 [L130] SORT_1 init_30_arg_1 = var_24; [L131] state_29 = init_30_arg_1 [L132] SORT_1 init_32_arg_1 = var_24; [L133] state_31 = init_32_arg_1 [L134] SORT_1 init_34_arg_1 = var_24; [L135] state_33 = init_34_arg_1 [L136] SORT_1 init_36_arg_1 = var_24; [L137] state_35 = init_36_arg_1 [L138] SORT_1 init_38_arg_1 = var_24; [L139] state_37 = init_38_arg_1 [L140] SORT_1 init_40_arg_1 = var_24; [L141] state_39 = init_40_arg_1 [L142] SORT_1 init_42_arg_1 = var_24; [L143] state_41 = init_42_arg_1 [L144] SORT_1 init_44_arg_1 = var_24; [L145] state_43 = init_44_arg_1 [L146] SORT_1 init_46_arg_1 = var_24; [L147] state_45 = init_46_arg_1 [L148] SORT_1 init_48_arg_1 = var_24; [L149] state_47 = init_48_arg_1 [L150] SORT_1 init_50_arg_1 = var_24; [L151] state_49 = init_50_arg_1 [L152] SORT_1 init_52_arg_1 = var_24; [L153] state_51 = init_52_arg_1 [L154] SORT_1 init_54_arg_1 = var_24; [L155] state_53 = init_54_arg_1 [L156] SORT_1 init_56_arg_1 = var_24; [L157] state_55 = init_56_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L160] input_67 = __VERIFIER_nondet_uchar() [L161] EXPR input_67 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L161] input_67 = input_67 & mask_SORT_1 [L162] input_69 = __VERIFIER_nondet_uchar() [L163] EXPR input_69 & mask_SORT_1 VAL [input_67=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L163] input_69 = input_69 & mask_SORT_1 [L164] input_71 = __VERIFIER_nondet_uchar() [L165] EXPR input_71 & mask_SORT_1 VAL [input_67=0, input_69=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L165] input_71 = input_71 & mask_SORT_1 [L166] input_73 = __VERIFIER_nondet_uchar() [L167] EXPR input_73 & mask_SORT_1 VAL [input_67=0, input_69=0, input_71=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L167] input_73 = input_73 & mask_SORT_1 [L168] input_79 = __VERIFIER_nondet_uchar() [L169] EXPR input_79 & mask_SORT_1 VAL [input_67=0, input_69=0, input_71=0, input_73=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L169] input_79 = input_79 & mask_SORT_1 [L170] input_82 = __VERIFIER_nondet_uchar() [L171] EXPR input_82 & mask_SORT_1 VAL [input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L171] input_82 = input_82 & mask_SORT_1 [L172] input_83 = __VERIFIER_nondet_uchar() [L173] EXPR input_83 & mask_SORT_1 VAL [input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L173] input_83 = input_83 & mask_SORT_1 [L174] input_84 = __VERIFIER_nondet_uchar() [L175] EXPR input_84 & mask_SORT_1 VAL [input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L175] input_84 = input_84 & mask_SORT_1 [L176] input_85 = __VERIFIER_nondet_uchar() [L177] EXPR input_85 & mask_SORT_1 VAL [input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L177] input_85 = input_85 & mask_SORT_1 [L178] input_91 = __VERIFIER_nondet_uchar() [L179] EXPR input_91 & mask_SORT_1 VAL [input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L179] input_91 = input_91 & mask_SORT_1 [L180] input_94 = __VERIFIER_nondet_uchar() [L181] EXPR input_94 & mask_SORT_1 VAL [input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L181] input_94 = input_94 & mask_SORT_1 [L182] input_95 = __VERIFIER_nondet_uchar() [L183] EXPR input_95 & mask_SORT_1 VAL [input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L183] input_95 = input_95 & mask_SORT_1 [L184] input_96 = __VERIFIER_nondet_uchar() [L185] EXPR input_96 & mask_SORT_1 VAL [input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L185] input_96 = input_96 & mask_SORT_1 [L186] input_97 = __VERIFIER_nondet_uchar() [L187] EXPR input_97 & mask_SORT_1 VAL [input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L187] input_97 = input_97 & mask_SORT_1 [L188] input_103 = __VERIFIER_nondet_uchar() [L189] EXPR input_103 & mask_SORT_1 VAL [input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L189] input_103 = input_103 & mask_SORT_1 [L190] input_106 = __VERIFIER_nondet_uchar() [L191] EXPR input_106 & mask_SORT_1 VAL [input_103=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L191] input_106 = input_106 & mask_SORT_1 [L192] input_107 = __VERIFIER_nondet_uchar() [L193] EXPR input_107 & mask_SORT_1 VAL [input_103=0, input_106=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L193] input_107 = input_107 & mask_SORT_1 [L194] input_116 = __VERIFIER_nondet_uchar() [L195] EXPR input_116 & mask_SORT_1 VAL [input_103=0, input_106=0, input_107=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L195] input_116 = input_116 & mask_SORT_1 [L196] input_117 = __VERIFIER_nondet_uchar() [L197] EXPR input_117 & mask_SORT_1 VAL [input_103=0, input_106=0, input_107=0, input_116=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L197] input_117 = input_117 & mask_SORT_1 [L198] input_125 = __VERIFIER_nondet_uchar() [L199] EXPR input_125 & mask_SORT_1 VAL [input_103=0, input_106=0, input_107=0, input_116=0, input_117=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L199] input_125 = input_125 & mask_SORT_1 [L200] input_126 = __VERIFIER_nondet_uchar() [L201] EXPR input_126 & mask_SORT_1 VAL [input_103=0, input_106=0, input_107=0, input_116=0, input_117=0, input_125=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L201] input_126 = input_126 & mask_SORT_1 [L202] input_141 = __VERIFIER_nondet_uchar() [L203] input_143 = __VERIFIER_nondet_uchar() [L204] input_162 = __VERIFIER_nondet_uchar() [L205] input_164 = __VERIFIER_nondet_uchar() [L206] input_183 = __VERIFIER_nondet_uchar() [L207] input_185 = __VERIFIER_nondet_uchar() [L210] SORT_1 var_59_arg_0 = ~state_27; VAL [input_103=0, input_106=0, input_107=0, input_116=0, input_117=0, input_125=0, input_126=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_59_arg_0=-1, var_68=2, var_70=1, var_72=0] [L211] EXPR var_59_arg_0 & mask_SORT_1 VAL [input_103=0, input_106=0, input_107=0, input_116=0, input_117=0, input_125=0, input_126=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L211] var_59_arg_0 = var_59_arg_0 & mask_SORT_1 [L212] SORT_4 var_59_arg_1 = var_57; [L213] SORT_4 var_59_arg_2 = var_58; [L214] SORT_4 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L215] SORT_1 var_60_arg_0 = state_33; [L216] SORT_4 var_60_arg_1 = var_57; [L217] SORT_4 var_60_arg_2 = var_58; [L218] SORT_4 var_60 = var_60_arg_0 ? var_60_arg_1 : var_60_arg_2; [L219] SORT_4 var_61_arg_0 = var_59; [L220] SORT_4 var_61_arg_1 = var_60; [L221] SORT_4 var_61 = var_61_arg_0 + var_61_arg_1; [L222] SORT_1 var_62_arg_0 = state_39; [L223] SORT_4 var_62_arg_1 = var_57; [L224] SORT_4 var_62_arg_2 = var_58; [L225] SORT_4 var_62 = var_62_arg_0 ? var_62_arg_1 : var_62_arg_2; [L226] SORT_4 var_63_arg_0 = var_61; [L227] SORT_4 var_63_arg_1 = var_62; [L228] SORT_4 var_63 = var_63_arg_0 + var_63_arg_1; VAL [input_103=0, input_106=0, input_107=0, input_116=0, input_117=0, input_125=0, input_126=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_63=0, var_68=2, var_70=1, var_72=0] [L229] EXPR var_63 & mask_SORT_4 VAL [input_103=0, input_106=0, input_107=0, input_116=0, input_117=0, input_125=0, input_126=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L229] var_63 = var_63 & mask_SORT_4 [L230] SORT_4 var_64_arg_0 = var_63; [L231] SORT_4 var_64_arg_1 = var_57; [L232] SORT_1 var_64 = var_64_arg_0 <= var_64_arg_1; [L233] SORT_1 var_65_arg_0 = ~state_55; VAL [input_103=0, input_106=0, input_107=0, input_116=0, input_117=0, input_125=0, input_126=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_64=1, var_65_arg_0=-1, var_68=2, var_70=1, var_72=0] [L234] EXPR var_65_arg_0 & mask_SORT_1 VAL [input_103=0, input_106=0, input_107=0, input_116=0, input_117=0, input_125=0, input_126=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_64=1, var_68=2, var_70=1, var_72=0] [L234] var_65_arg_0 = var_65_arg_0 & mask_SORT_1 [L235] SORT_1 var_65_arg_1 = ~var_64; VAL [input_103=0, input_106=0, input_107=0, input_116=0, input_117=0, input_125=0, input_126=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_65_arg_0=1, var_65_arg_1=-2, var_68=2, var_70=1, var_72=0] [L236] EXPR var_65_arg_1 & mask_SORT_1 VAL [input_103=0, input_106=0, input_107=0, input_116=0, input_117=0, input_125=0, input_126=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_65_arg_0=1, var_68=2, var_70=1, var_72=0] [L236] var_65_arg_1 = var_65_arg_1 & mask_SORT_1 [L237] EXPR var_65_arg_0 & var_65_arg_1 VAL [input_103=0, input_106=0, input_107=0, input_116=0, input_117=0, input_125=0, input_126=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L237] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L238] EXPR var_65 & mask_SORT_1 VAL [input_103=0, input_106=0, input_107=0, input_116=0, input_117=0, input_125=0, input_126=0, input_67=0, input_69=0, input_71=0, input_73=0, input_79=0, input_82=0, input_83=0, input_84=0, input_85=0, input_91=0, input_94=0, input_95=0, input_96=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_6=0, state_8=0, var_108=6, var_109=255, var_118=24, var_127=14, var_292=0, var_294=6, var_326=24, var_358=14, var_57=1, var_58=0, var_68=2, var_70=1, var_72=0] [L238] var_65 = var_65 & mask_SORT_1 [L239] SORT_1 bad_66_arg_0 = var_65; [L240] CALL __VERIFIER_assert(!(bad_66_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 2268 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12711 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12711 mSDsluCounter, 54001 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37226 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23758 IncrementalHoareTripleChecker+Invalid, 23761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 16775 mSDtfsCounter, 23758 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2371occurred in iteration=7, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 3776 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 899 NumberOfCodeBlocks, 899 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 776 ConstructedInterpolants, 0 QuantifiedInterpolants, 2272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 23:21:38,365 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.lann.1.prop1-func-interl.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 cd6ac0f1fc1701a755f398ed8f8c999e6c7d4b309c48c83fd17b2861bc532c01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:21:40,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:21:40,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 23:21:40,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:21:40,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:21:40,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:21:40,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:21:40,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:21:40,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:21:40,514 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:21:40,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:21:40,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:21:40,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:21:40,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:21:40,515 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:21:40,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:21:40,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:21:40,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:21:40,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:21:40,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:21:40,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:21:40,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:21:40,516 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:21:40,516 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:21:40,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:21:40,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:21:40,517 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:21:40,517 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:21:40,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:21:40,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:21:40,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:21:40,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:21:40,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:21:40,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:21:40,518 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:21:40,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:21:40,518 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:21:40,518 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:21:40,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:21:40,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:21:40,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:21:40,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:21:40,518 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 -> cd6ac0f1fc1701a755f398ed8f8c999e6c7d4b309c48c83fd17b2861bc532c01 [2025-02-07 23:21:40,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:21:40,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:21:40,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:21:40,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:21:40,789 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:21:40,790 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.lann.1.prop1-func-interl.c [2025-02-07 23:21:41,968 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc7635de2/6e738d2a05504d67a461b33db9a9f532/FLAG97d57dd39 [2025-02-07 23:21:42,248 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:21:42,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.lann.1.prop1-func-interl.c [2025-02-07 23:21:42,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc7635de2/6e738d2a05504d67a461b33db9a9f532/FLAG97d57dd39 [2025-02-07 23:21:42,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc7635de2/6e738d2a05504d67a461b33db9a9f532 [2025-02-07 23:21:42,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:21:42,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:21:42,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:21:42,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:21:42,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:21:42,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:21:42" (1/1) ... [2025-02-07 23:21:42,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349945db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:42, skipping insertion in model container [2025-02-07 23:21:42,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:21:42" (1/1) ... [2025-02-07 23:21:42,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:21:42,717 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.lann.1.prop1-func-interl.c[1171,1184] [2025-02-07 23:21:42,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:21:42,932 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:21:42,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.lann.1.prop1-func-interl.c[1171,1184] [2025-02-07 23:21:43,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:21:43,071 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:21:43,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:43 WrapperNode [2025-02-07 23:21:43,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:21:43,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:21:43,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:21:43,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:21:43,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:43" (1/1) ... [2025-02-07 23:21:43,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:43" (1/1) ... [2025-02-07 23:21:43,170 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1761 [2025-02-07 23:21:43,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:21:43,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:21:43,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:21:43,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:21:43,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:43" (1/1) ... [2025-02-07 23:21:43,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:43" (1/1) ... [2025-02-07 23:21:43,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:43" (1/1) ... [2025-02-07 23:21:43,225 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 23:21:43,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:43" (1/1) ... [2025-02-07 23:21:43,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:43" (1/1) ... [2025-02-07 23:21:43,259 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:43" (1/1) ... [2025-02-07 23:21:43,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:43" (1/1) ... [2025-02-07 23:21:43,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:43" (1/1) ... [2025-02-07 23:21:43,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:43" (1/1) ... [2025-02-07 23:21:43,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:21:43,290 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:21:43,291 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:21:43,291 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:21:43,292 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:43" (1/1) ... [2025-02-07 23:21:43,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:21:43,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:21:43,321 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 23:21:43,327 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 23:21:43,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:21:43,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:21:43,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:21:43,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:21:43,628 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:21:43,629 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:21:44,815 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2025-02-07 23:21:44,815 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:21:44,821 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:21:44,822 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:21:44,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:21:44 BoogieIcfgContainer [2025-02-07 23:21:44,822 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:21:44,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:21:44,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:21:44,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:21:44,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:21:42" (1/3) ... [2025-02-07 23:21:44,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c943da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:21:44, skipping insertion in model container [2025-02-07 23:21:44,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:21:43" (2/3) ... [2025-02-07 23:21:44,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c943da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:21:44, skipping insertion in model container [2025-02-07 23:21:44,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:21:44" (3/3) ... [2025-02-07 23:21:44,829 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.lann.1.prop1-func-interl.c [2025-02-07 23:21:44,839 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:21:44,841 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.lann.1.prop1-func-interl.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:21:44,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:21:44,884 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;@7d0a9681, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:21:44,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:21:44,887 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 23:21:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:21:44,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:21:44,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:21:44,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:21:44,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:21:44,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:21:44,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:21:44,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1146849636] [2025-02-07 23:21:44,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:21:44,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:21:44,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:21:44,910 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 23:21:44,919 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 23:21:45,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:21:45,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:21:45,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:21:45,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:21:45,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-07 23:21:45,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:21:45,521 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 23:21:45,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:21:45,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:21:45,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146849636] [2025-02-07 23:21:45,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146849636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:21:45,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:21:45,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:21:45,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287749962] [2025-02-07 23:21:45,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:21:45,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:21:45,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:21:45,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:21:45,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:21:45,544 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 23:21:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:21:45,663 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 23:21:45,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:21:45,665 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 23:21:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:21:45,669 INFO L225 Difference]: With dead ends: 16 [2025-02-07 23:21:45,669 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 23:21:45,670 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 23:21:45,672 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 23:21:45,672 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 23:21:45,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 23:21:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 23:21:45,691 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 23:21:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 23:21:45,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 23:21:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:21:45,695 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 23:21:45,695 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 23:21:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 23:21:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 23:21:45,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:21:45,696 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 23:21:45,705 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 23:21:45,896 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 23:21:45,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:21:45,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:21:45,897 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 23:21:45,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:21:45,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1368764400] [2025-02-07 23:21:45,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:21:45,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:21:45,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:21:45,909 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 23:21:45,910 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 23:21:46,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 23:21:46,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 23:21:46,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:21:46,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:21:46,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-07 23:21:46,319 INFO L279 TraceCheckSpWp]: Computing forward predicates...